Method and device for image encoding/decoding on basis of asymmetric sub-block

ABSTRACT

The present invention relates to a video encoding/decoding method and apparatus. The video decoding method according to the present invention may comprise dividing a coding unit into a plurality of sub-units according to a block division structure and performing decoding based on the sub-unit, wherein the block division structure is a block division structure in which division is performed so as to include at least one sub-unit having a predetermined block form other than square and rectangle forms.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a U.S. National Stage Application of InternationalApplication No. PCT/KR2018/012861, filed on Oct. 26, 2018, which claimsthe benefit under 35 USC 119(a) and 365(b) of Korean Patent ApplicationNo. 10-2017-0140206, filed on Oct. 26, 2017 in the Korean IntellectualProperty Office, the entire disclosure of which is incorporated hereinby reference for all purposes.

TECHNICAL FIELD

The present invention relates to a method and apparatus forencoding/decoding a video, and a recording medium storing a bitstream.More particularly, the present invention relates to a method andapparatus for encoding/decoding a video on the basis of at least oneasymmetric sub-block.

BACKGROUND ART

Recently, demands for high-resolution and high-quality videos, such ashigh-definition (HD) and ultrahigh-definition (UHD) videos, haveincreased in various fields of applications. As video data has higherresolution and higher quality, the amount of data is increased relativeto existing video data. Accordingly, when video data is transferredusing media such as existing wired and wireless broad band lines or isstored in existing storage media, transfer and storage costs increase.In order to solve these problems occurring with an increase inresolution and quality of video data, high-efficiency video compressiontechniques may be utilized.

Video compression technology include various techniques, such as aninter prediction technique of predicting pixel values included in acurrent picture from previous or subsequent pictures of the currentpicture, an intra prediction technique of predicting pixel valuesincluded in a current picture using pixel information in the currentpicture, and an entropy encoding technique of assigning a short code toa value with a high appearance frequency and assigning a long code to avalue with a low appearance frequency. Video data may be effectivelycompressed and transferred or stored using such video compressiontechniques.

In a conventional video encoding/decoding method and apparatus, anencoding/decoding block always has a square form or rectangle form orboth, and is divided by using a quad-tree form. Accordingly,encoding/decoding considering the local characteristics in a video islimited.

DISCLOSURE Technical Problem

An object of the present invention is to provide a method and apparatusfor video encoding/decoding using various asymmetric sub-block divisionstructures.

In addition, another object of the present invention is to provide amethod and apparatus for video encoding/decoding, wherein prediction isindependently performed for asymmetric sub-blocks.

In addition, still another object of the present invention is to providea recording medium storing a bitstream generated by a method andapparatus for video encoding/decoding of the present invention.

In addition, still another object of the present invention is to providea method and apparatus for asymmetric sub-block based encoding/decodinga video, wherein at least one block division structure of a blockdivision structure of a binary-tree after quad-tree form, a blockdivision structure of a combined quad-tree and binary-tree form, and ablock division structure of a separated PU/TU tree is used to improveencoding/decoding efficiency.

In addition, still another object of the present invention is to providea method and apparatus for video encoding/decoding, wherein a currentblock is divided into at least one asymmetric sub-block and differentlyperforming prediction for each asymmetric sub-block.

Technical Solution

A method of decoding an image according to the present invention, themethod may comprise dividing a coding unit into a plurality of sub-unitsaccording to a block division structure; and performing decoding basedon the sub-unit, wherein the block division structure is a blockdivision structure in which division is performed so as to include atleast one sub-unit having a predetermined block form other than squareand rectangle forms.

In the method of decoding an image according to the present invention,wherein the performing of decoding based on the sub-unit includesperforming decoding by performing at least one of intra-prediction andinter-prediction based on the sub-unit.

In the method of decoding an image according to the present invention,wherein the performing of decoding based on the sub-unit includesperforming decoding by performing at least one of inverse-transform anddequantization based on the sub-unit.

In the method of decoding an image according to the present invention,wherein the block division structure is a block division structure inwhich the coding unit is divided so as to include a triangle-formsub-unit.

In the method of decoding an image according to the present invention,wherein the triangle form is at least one of a triangle form obtained bydividing the coding unit by a diagonal boundary from the left-upper tothe right-lower of the coding unit, and a triangle form obtained bydividing the coding unit by a diagonal boundary from the right-upper tothe left-lower of the coding unit.

In the method of decoding an image according to the present invention,wherein the block division structure is determined based on a flagrepresenting whether or not the coding unit is divided.

In the method of decoding an image according to the present invention,wherein the block division structure is determined based on a flagrepresenting whether or not the coding unit is divided and an indexrepresenting a division type of the sub-unit.

In the method of decoding an image according to the present invention,wherein the division type of the sub-unit represent a division directionof the sub-unit.

Also, A method of encoding an image according to the present invention,the method may comprise dividing a coding unit into a plurality ofsub-units according to a block division structure; and performingencoding based on the sub-unit, wherein the block division structure isa block division structure in which division is performed so as toinclude at least one sub-unit having a predetermined block form otherthan square and rectangle forms.

In the method of encoding an image according to the present invention,wherein the performing of encoding based on the sub-unit includesperforming encoding by performing at least one of intra-prediction andinter-prediction based on the sub-unit.

In the method of encoding an image according to the present invention,wherein the performing of encoding based on the sub-unit includesperforming encoding by performing at least one of transform andquantization based on the sub-unit.

In the method of encoding an image according to the present invention,wherein the block division structure is a block division structure inwhich the coding unit is divided so as to include a triangle-formsub-unit.

In the method of encoding an image according to the present invention,wherein the triangle form is at least one of a triangle form obtained bydividing the coding unit by a diagonal boundary from the left-upper tothe right-lower of the coding unit, and a triangle form obtained bydividing the coding unit by a diagonal boundary from the right-upper tothe left-lower of the coding unit.

In the method of encoding an image according to the present invention,wherein the block division structure is determined based on a flagrepresenting whether or not the coding unit is divided.

In the method of encoding an image according to the present invention,wherein the block division structure is determined based on a flagrepresenting whether or not the coding unit is divided and an indexrepresenting a division type of the sub-unit.

In the method of encoding an image according to the present invention,wherein the division type of the sub-unit represents a divisiondirection of the sub-unit.

Also, a computer-readable recording medium according to the presentinvention may store a bitstream generated by an image encoding methodaccording to the present invention.

Advantageous Effects

As described above, the present invention, according to the presentinvention, there is provided a method and apparatus for videoencoding/decoding using various asymmetric sub-block divisionstructures.

In addition, according to the present invention, there is provided amethod and apparatus for video encoding/decoding, wherein prediction canbe independently performed for asymmetric sub-blocks.

In addition, according to the present invention, there is provided arecording medium storing a bitstream generated by a method and apparatusfor video encoding/decoding of the present invention.

In addition, according to the present invention, video encoding anddecoding efficiency can be improved.

DESCRIPTION OF DRAWINGS

FIG. 1 is a block diagram showing a configuration of an embodiment of anencoding apparatus to which the present invention is applied.

FIG. 2 is a block diagram of an embodiment of a decoding apparatus towhich the present invention is applied.

FIG. 3 is a view schematically showing a division structure of a videowhen encoding and decoding the video.

FIG. 4 is a view showing an embodiment of intra-prediction.

FIG. 5 is a view showing an embodiment of inter-prediction.

FIG. 6 is a view showing transform and quantization.

FIG. 7 is a view of a flowchart showing a method of decoding a videoaccording to an embodiment of the present invention.

FIG. 8 is a view showing a method of deriving a spatial merge candidateaccording to an embodiment of the present invention.

FIG. 9 is a view showing a method of deriving a temporal merge candidateaccording to an embodiment of the present invention.

FIG. 10 is a view showing a method of deriving a sub-block basedtemporal spatial combined merge candidate according to an embodiment ofthe present invention.

FIG. 11 is a view showing a method of deriving inter-predictioninformation by using a bilateral matching according to an embodiment ofthe present invention.

FIG. 12 is a view showing a method of deriving inter-predictioninformation by using a template matching method according to anembodiment of the present invention.

FIG. 13 is a view showing a method of deriving inter-predictioninformation on the basis of OMBC (overlapped block motion compensation)according to an embodiment of the present invention.

FIG. 14 is a view showing quad-tree division, symmetric binary-treedivision, and asymmetric binary division according to an embodiment ofthe present invention.

FIG. 15 is a view showing symmetric binary-tree division after quad-treedivision according to an embodiment of the present invention.

FIG. 16 is a view showing asymmetric division according to an embodimentof the present invention.

FIG. 17 is a view showing a method of deriving motion predictioninformation of a sub-block by using a lowest level sub-block accordingto an embodiment of the present invention.

FIG. 18 is a view of a flowchart of a video encoding method an accordingto an embodiment of the present invention.

MODE FOR INVENTION

A variety of modifications may be made to the present invention andthere are various embodiments of the present invention, examples ofwhich will now be provided with reference to drawings and described indetail. However, the present invention is not limited thereto, althoughthe exemplary embodiments can be construed as including allmodifications, equivalents, or substitutes in a technical concept and atechnical scope of the present invention. The similar reference numeralsrefer to the same or similar functions in various aspects. In thedrawings, the shapes and dimensions of elements may be exaggerated forclarity. In the following detailed description of the present invention,references are made to the accompanying drawings that show, by way ofillustration, specific embodiments in which the invention may bepracticed. These embodiments are described in sufficient detail toenable those skilled in the art to implement the present disclosure. Itshould be understood that various embodiments of the present disclosure,although different, are not necessarily mutually exclusive. For example,specific features, structures, and characteristics described herein, inconnection with one embodiment, may be implemented within otherembodiments without departing from the spirit and scope of the presentdisclosure. In addition, it should be understood that the location orarrangement of individual elements within each disclosed embodiment maybe modified without departing from the spirit and scope of the presentdisclosure. The following detailed description is, therefore, not to betaken in a limiting sense, and the scope of the present disclosure isdefined only by the appended claims, appropriately interpreted, alongwith the full range of equivalents to what the claims claim.

Terms used in the specification, ‘first’, ‘second’, etc. can be used todescribe various components, but the components are not to be construedas being limited to the terms. The terms are only used to differentiateone component from other components. For example, the ‘first’ componentmay be named the ‘second’ component without departing from the scope ofthe present invention, and the ‘second’ component may also be similarlynamed the ‘first’ component. The term ‘and/or’ includes a combination ofa plurality of items or any one of a plurality of terms.

It will be understood that when an element is simply referred to asbeing ‘connected to’ or ‘coupled to’ another element without being‘directly connected to’ or ‘directly coupled to’ another element in thepresent description, it may be ‘directly connected to’ or ‘directlycoupled to’ another element or be connected to or coupled to anotherelement, having the other element intervening therebetween. In contrast,it should be understood that when an element is referred to as being“directly coupled” or “directly connected” to another element, there areno intervening elements present.

Furthermore, constitutional parts shown in the embodiments of thepresent invention are independently shown so as to representcharacteristic functions different from each other. Thus, it does notmean that each constitutional part is constituted in a constitutionalunit of separated hardware or software. In other words, eachconstitutional part includes each of enumerated constitutional parts forconvenience. Thus, at least two constitutional parts of eachconstitutional part may be combined to form one constitutional part orone constitutional part may be divided into a plurality ofconstitutional parts to perform each function. The embodiment where eachconstitutional part is combined and the embodiment where oneconstitutional part is divided are also included in the scope of thepresent invention, if not departing from the essence of the presentinvention.

The terms used in the present specification are merely used to describeparticular embodiments, and are not intended to limit the presentinvention. An expression used in the singular encompasses the expressionof the plural, unless it has a clearly different meaning in the context.In the present specification, it is to be understood that terms such as“including”, “having”, etc. are intended to indicate the existence ofthe features, numbers, steps, actions, elements, parts, or combinationsthereof disclosed in the specification, and are not intended to precludethe possibility that one or more other features, numbers, steps,actions, elements, parts, or combinations thereof may exist or may beadded. In other words, when a specific element is referred to as being“included”, elements other than the corresponding element are notexcluded, but additional elements may be included in embodiments of thepresent invention or the scope of the present invention.

In addition, some of constituents may not be indispensable constituentsperforming essential functions of the present invention but be selectiveconstituents improving only performance thereof. The present inventionmay be implemented by including only the indispensable constitutionalparts for implementing the essence of the present invention except theconstituents used in improving performance. The structure including onlythe indispensable constituents except the selective constituents used inimproving only performance is also included in the scope of the presentinvention.

Hereinafter, embodiments of the present invention will be described indetail with reference to the accompanying drawings. In describingexemplary embodiments of the present invention, well-known functions orconstructions will not be described in detail since they mayunnecessarily obscure the understanding of the present invention. Thesame constituent elements in the drawings are denoted by the samereference numerals, and a repeated description of the same elements willbe omitted.

Hereinafter, an image may mean a picture configuring a video, or maymean the video itself. For example, “encoding or decoding or both of animage” may mean “encoding or decoding or both of a moving picture”, andmay mean “encoding or decoding or both of one image among images of amoving picture.”

Hereinafter, terms “moving picture” and “video” may be used as the samemeaning and be replaced with each other.

Hereinafter, a target image may be an encoding target image which is atarget of encoding and/or a decoding target image which is a target ofdecoding. Also, a target image may be an input image inputted to anencoding apparatus, and an input image inputted to a decoding apparatus.Here, a target image may have the same meaning with the current image.

Hereinafter, terms “image”, “picture, “frame” and “screen” may be usedas the same meaning and be replaced with each other.

Hereinafter, a target block may be an encoding target block which is atarget of encoding and/or a decoding target block which is a target ofdecoding. Also, a target block may be the current block which is atarget of current encoding and/or decoding. For example, terms “targetblock” and “current block” may be used as the same meaning and bereplaced with each other.

Hereinafter, terms “block” and “unit” may be used as the same meaningand be replaced with each other. Or a “block” may represent a specificunit.

Hereinafter, terms “region” and “segment” may be replaced with eachother.

Hereinafter, a specific signal may be a signal representing a specificblock. For example, an original signal may be a signal representing atarget block. A prediction signal may be a signal representing aprediction block. A residual signal may be a signal representing aresidual block.

In embodiments, each of specific information, data, flag, index, elementand attribute, etc. may have a value. A value of information, data,flag, index, element and attribute equal to “0” may represent a logicalfalse or the first predefined value. In other words, a value “0”, afalse, a logical false and the first predefined value may be replacedwith each other. A value of information, data, flag, index, element andattribute equal to “1” may represent a logical true or the secondpredefined value. In other words, a value “1”, a true, a logical trueand the second predefined value may be replaced with each other.

When a variable i or j is used for representing a column, a row or anindex, a value of i may be an integer equal to or greater than 0, orequal to or greater than 1. That is, the column, the row, the index,etc. may be counted from 0 or may be counted from 1.

Description of Terms

Encoder: means an apparatus performing encoding. That is, means anencoding apparatus.

Decoder: means an apparatus performing decoding. That is, means adecoding apparatus.

Block: is an M×N array of a sample. Herein, M and N may mean positiveintegers, and the block may mean a sample array of a two-dimensionalform. The block may refer to a unit. A current block my mean an encodingtarget block that becomes a target when encoding, or a decoding targetblock that becomes a target when decoding. In addition, the currentblock may be at least one of an encode block, a prediction block, aresidual block, and a transform block.

Sample: is a basic unit constituting a block. It may be expressed as avalue from 0 to 2Bd−1 according to a bit depth (Bd). In the presentinvention, the sample may be used as a meaning of a pixel. That is, asample, a pel, a pixel may have the same meaning with each other.

Unit: may refer to an encoding and decoding unit. When encoding anddecoding an image, the unit may be a region generated by partitioning asingle image. In addition, the unit may mean a subdivided unit when asingle image is partitioned into subdivided units during encoding ordecoding. That is, an image may be partitioned into a plurality ofunits. When encoding and decoding an image, a predetermined process foreach unit may be performed. A single unit may be partitioned intosub-units that have sizes smaller than the size of the unit. Dependingon functions, the unit may mean a block, a macroblock, a coding treeunit, a code tree block, a coding unit, a coding block, a predictionunit, a prediction block, a residual unit, a residual block, a transformunit, a transform block, etc. In addition, in order to distinguish aunit from a block, the unit may include a luma component block, a chromacomponent block associated with the luma component block, and a syntaxelement of each color component block. The unit may have various sizesand forms, and particularly, the form of the unit may be atwo-dimensional geometrical figure such as a square shape, a rectangularshape, a trapezoid shape, a triangular shape, a pentagonal shape, etc.In addition, unit information may include at least one of a unit typeindicating the coding unit, the prediction unit, the transform unit,etc., and a unit size, a unit depth, a sequence of encoding and decodingof a unit, etc.

Coding Tree Unit: is configured with a single coding tree block of aluma component Y, and two coding tree blocks related to chromacomponents Cb and Cr. In addition, it may mean that including the blocksand a syntax element of each block. Each coding tree unit may bepartitioned by using at least one of a quad-tree partitioning method, abinary-tree partitioning method and ternary-tree partitioning method toconfigure a lower unit such as coding unit, prediction unit, transformunit, etc. It may be used as a term for designating a sample block thatbecomes a process unit when encoding/decoding an image as an inputimage. Here, the quad-tree may mean a quarternary-tree.

Coding Tree Block: may be used as a term for designating any one of a Ycoding tree block, Cb coding tree block, and Cr coding tree block.

Neighbor Block: may mean a block adjacent to a current block. The blockadjacent to the current block may mean a block that comes into contactwith a boundary of the current block, or a block positioned within apredetermined distance from the current block. The neighbor block maymean a block adjacent to a vertex of the current block. Herein, theblock adjacent to the vertex of the current block may mean a blockvertically adjacent to a neighbor block that is horizontally adjacent tothe current block, or a block horizontally adjacent to a neighbor blockthat is vertically adjacent to the current block.

Reconstructed Neighbor block: may mean a neighbor block adjacent to acurrent block and which has been already spatially/temporally encoded ordecoded. Herein, the reconstructed neighbor block may mean areconstructed neighbor unit. A reconstructed spatial neighbor block maybe a block within a current picture and which has been alreadyreconstructed through encoding or decoding or both. A reconstructedtemporal neighbor block is a block at a corresponding position as thecurrent block of the current picture within a reference image, or aneighbor block thereof.

Unit Depth: may mean a partitioned degree of a unit. In a treestructure, the highest node(Root Node) may correspond to the first unitwhich is not partitioned. Also, the highest node may have the leastdepth value. In this case, the highest node may have a depth of level 0.A node having a depth of level 1 may represent a unit generated bypartitioning once the first unit. A node having a depth of level 2 mayrepresent a unit generated by partitioning twice the first unit. A nodehaving a depth of level n may represent a unit generated by partitioningn-times the first unit. A Leaf Node may be the lowest node and a nodewhich cannot be partitioned further. A depth of a Leaf Node may be themaximum level. For example, a predefined value of the maximum level maybe 3. A depth of a root node may be the lowest and a depth of a leafnode may be the deepest. In addition, when a unit is expressed as a treestructure, a level in which a unit is present may mean a unit depth.

Bitstream: may mean a bitstream including encoding image information.

Parameter Set: corresponds to header information among a configurationwithin a bitstream. At least one of a video parameter set, a sequenceparameter set, a picture parameter set, and an adaptation parameter setmay be included in a parameter set. In addition, a parameter set mayinclude a slice header, and tile header information.

Parsing: may mean determination of a value of a syntax element byperforming entropy decoding, or may mean the entropy decoding itself.

Symbol: may mean at least one of a syntax element, a coding parameter,and a transform coefficient value of an encoding/decoding target unit.In addition, the symbol may mean an entropy encoding target or anentropy decoding result.

Prediction Mode: may be information indicating a mode encoded/decodedwith intra prediction or a mode encoded/decoded with inter prediction.

Prediction Unit: may mean a basic unit when performing prediction suchas inter-prediction, intra-prediction, inter-compensation,intra-compensation, and motion compensation. A single prediction unitmay be partitioned into a plurality of partitions having a smaller size,or may be partitioned into a plurality of lower prediction units. Aplurality of partitions may be a basic unit in performing prediction orcompensation. A partition which is generated by dividing a predictionunit may also be a prediction unit.

Prediction Unit Partition: may mean a form obtained by partitioning aprediction unit.

Reference picture list may refer to a list including one or morereference pictures used for inter prediction or motion compensation.There are several types of usable reference picture lists, including LC(List combined), L0 (List 0), L1 (List 1), L2 (List 2), L3 (List 3).

Inter prediction indicator may refer to a direction of inter prediction(unidirectional prediction, bidirectional prediction, etc.) of a currentblock. Alternatively, it may refer to the number of reference picturesused to generate a prediction block of a current block. Alternatively,it may refer to the number of prediction blocks used at the time ofperforming inter prediction or motion compensation on a current block.

Prediction list utilization flag indicates whether a prediction block isgenerated using at least one reference picture in a specific referencepicture list. An inter prediction indicator can be derived using aprediction list utilization flag, and conversely, a prediction listutilization flag can be derived using an inter prediction indicator. Forexample, when the prediction list utilization flag has a first value ofzero (0), it means that a reference picture in a reference picture listis not used to generate a prediction block. On the other hand, when theprediction list utilization flag has a second value of one (1), it meansthat a reference picture list is used to generate a prediction block.

Reference picture index may refer to an index indicating a specificreference picture in a reference picture list.

Reference picture may mean a reference picture which is referred to by aspecific block for the purposes of inter prediction or motioncompensation of the specific block. Alternatively, the reference picturemay be a picture including a reference block referred to by a currentblock for inter prediction or motion compensation. Hereinafter, theterms “reference picture” and “reference image” have the same meaningand can be interchangeably.

Motion vector may be a two-dimensional vector used for inter predictionor motion compensation. The motion vector may mean an offset between anencoding/decoding target block and a reference block. For example, (mvX,mvY) may represent a motion vector. Here, mvX may represent a horizontalcomponent and mvY may represent a vertical component.

Search range may be a two-dimensional region which is searched toretrieve a motion vector during inter prediction. For example, the sizeof the search range may be M×N. Here, M and N are both integers.

Motion vector candidate may refer to a prediction candidate block or amotion vector of the prediction candidate block when predicting a motionvector. In addition, a motion vector candidate may be included in amotion vector candidate list.

Motion vector candidate list may mean a list composed of one or moremotion vector candidates.

Motion vector candidate index may mean an indicator indicating a motionvector candidate in a motion vector candidate list. Alternatively, itmay be an index of a motion vector predictor.

Motion information may mean information including at least one of theitems including a motion vector, a reference picture index, an interprediction indicator, a prediction list utilization flag, referencepicture list information, a reference picture, a motion vectorcandidate, a motion vector candidate index, a merge candidate, and amerge index.

Merge candidate list may mean a list composed of one or more mergecandidates.

Merge candidate may mean a spatial merge candidate, a temporal mergecandidate, a combined merge candidate, a combined bi-predictive mergecandidate, or a zero merge candidate. The merge candidate may includemotion information such as a reference picture index for each list, amotion vector, a prediction list utilization flag, and an interprediction indicator.

Merge index may mean an indicator indicating a merge candidate in amerge candidate list. Alternatively, the merge index may indicate ablock from which a merge candidate has been derived, among reconstructedblocks spatially/temporally adjacent to a current block. Alternatively,the merge index may indicate at least one piece of motion information ofa merge candidate.

Transform Unit: may mean a basic unit when performing encoding/decodingsuch as transform, inverse-transform, quantization, dequantization,transform coefficient encoding/decoding of a residual signal. A singletransform unit may be partitioned into a plurality of lower-leveltransform units having a smaller size. Here,transformation/inverse-transformation may comprise at least one amongthe first transformation/the first inverse-transformation and the secondtransformation/the second inverse-transformation.

Scaling: may mean a process of multiplying a quantized level by afactor. A transform coefficient may be generated by scaling a quantizedlevel. The scaling also may be referred to as dequantization.

Quantization Parameter: may mean a value used when generating aquantized level using a transform coefficient during quantization. Thequantization parameter also may mean a value used when generating atransform coefficient by scaling a quantized level duringdequantization. The quantization parameter may be a value mapped on aquantization step size.

Delta Quantization Parameter: may mean a difference value between apredicted quantization parameter and a quantization parameter of anencoding/decoding target unit.

Scan: may mean a method of sequencing coefficients within a unit, ablock or a matrix. For example, changing a two-dimensional matrix ofcoefficients into a one-dimensional matrix may be referred to asscanning, and changing a one-dimensional matrix of coefficients into atwo-dimensional matrix may be referred to as scanning or inversescanning.

Transform Coefficient: may mean a coefficient value generated aftertransform is performed in an encoder. It may mean a coefficient valuegenerated after at least one of entropy decoding and dequantization isperformed in a decoder. A quantized level obtained by quantizing atransform coefficient or a residual signal, or a quantized transformcoefficient level also may fall within the meaning of the transformcoefficient.

Quantized Level: may mean a value generated by quantizing a transformcoefficient or a residual signal in an encoder. Alternatively, thequantized level may mean a value that is a dequantization target toundergo dequantization in a decoder. Similarly, a quantized transformcoefficient level that is a result of transform and quantization alsomay fall within the meaning of the quantized level.

Non-zero Transform Coefficient: may mean a transform coefficient havinga value other than zero, or a transform coefficient level or a quantizedlevel having a value other than zero.

Quantization Matrix: may mean a matrix used in a quantization process ora dequantization process performed to improve subjective or objectiveimage quality. The quantization matrix also may be referred to as ascaling list.

Quantization Matrix Coefficient: may mean each element within aquantization matrix. The quantization matrix coefficient also may bereferred to as a matrix coefficient.

Default Matrix: may mean a predetermined quantization matrixpreliminarily defined in an encoder or a decoder.

Non-default Matrix: may mean a quantization matrix that is notpreliminarily defined in an encoder or a decoder but is signaled by auser.

Statistic Value: a statistic value for at least one among a variable, anencoding parameter, a constant value, etc. which have a computablespecific value may be one or more among an average value, a weightedaverage value, a weighted sum value, the minimum value, the maximumvalue, the most frequent value, a median value, an interpolated value ofthe corresponding specific values.

FIG. 1 is a block diagram showing a configuration of an encodingapparatus according to an embodiment to which the present invention isapplied.

An encoding apparatus 100 may be an encoder, a video encoding apparatus,or an image encoding apparatus. A video may include at least one image.The encoding apparatus 100 may sequentially encode at least one image.

Referring to FIG. 1 , the encoding apparatus 100 may include a motionprediction unit 111, a motion compensation unit 112, an intra-predictionunit 120, a switch 115, a subtractor 125, a transform unit 130, aquantization unit 140, an entropy encoding unit 150, a dequantizationunit 160, a inverse-transform unit 170, an adder 175, a filter unit 180,and a reference picture buffer 190.

The encoding apparatus 100 may perform encoding of an input image byusing an intra mode or an inter mode or both. In addition, encodingapparatus 100 may generate a bitstream including encoded informationthrough encoding the input image, and output the generated bitstream.The generated bitstream may be stored in a computer readable recordingmedium, or may be streamed through a wired/wireless transmission medium.When an intra mode is used as a prediction mode, the switch 115 may beswitched to an intra. Alternatively, when an inter mode is used as aprediction mode, the switch 115 may be switched to an inter mode.Herein, the intra mode may mean an intra-prediction mode, and the intermode may mean an inter-prediction mode. The encoding apparatus 100 maygenerate a prediction block for an input block of the input image. Inaddition, the encoding apparatus 100 may encode a residual block using aresidual of the input block and the prediction block after theprediction block being generated. The input image may be called as acurrent image that is a current encoding target. The input block may becalled as a current block that is current encoding target, or as anencoding target block.

When a prediction mode is an intra mode, the intra-prediction unit 120may use a sample of a block that has been already encoded/decoded and isadjacent to a current block as a reference sample. The intra-predictionunit 120 may perform spatial prediction for the current block by using areference sample, or generate prediction samples of an input block byperforming spatial prediction. Herein, the intra prediction may meanintra-prediction,

When a prediction mode is an inter mode, the motion prediction unit 111may retrieve a region that best matches with an input block from areference image when performing motion prediction, and deduce a motionvector by using the retrieved region. In this case, a search region maybe used as the region. The reference image may be stored in thereference picture buffer 190. Here, when encoding/decoding for thereference image is performed, it may be stored in the reference picturebuffer 190.

The motion compensation unit 112 may generate a prediction block byperforming motion compensation for the current block using a motionvector. Herein, inter-prediction may mean inter-prediction or motioncompensation.

When the value of the motion vector is not an integer, the motionprediction unit 111 and the motion compensation unit 112 may generatethe prediction block by applying an interpolation filter to a partialregion of the reference picture. In order to perform inter-pictureprediction or motion compensation on a coding unit, it may be determinedthat which mode among a skip mode, a merge mode, an advanced motionvector prediction (AMVP) mode, and a current picture referring mode isused for motion prediction and motion compensation of a prediction unitincluded in the corresponding coding unit. Then, inter-pictureprediction or motion compensation may be differently performed dependingon the determined mode.

The subtractor 125 may generate a residual block by using a residual ofan input block and a prediction block. The residual block may be calledas a residual signal. The residual signal may mean a difference betweenan original signal and a prediction signal. In addition, the residualsignal may be a signal generated by transforming or quantizing, ortransforming and quantizing a difference between the original signal andthe prediction signal. The residual block may be a residual signal of ablock unit.

The transform unit 130 may generate a transform coefficient byperforming transform of a residual block, and output the generatedtransform coefficient. Herein, the transform coefficient may be acoefficient value generated by performing transform of the residualblock. When a transform skip mode is applied, the transform unit 130 mayskip transform of the residual block.

A quantized level may be generated by applying quantization to thetransform coefficient or to the residual signal. Hereinafter, thequantized level may be also called as a transform coefficient inembodiments.

The quantization unit 140 may generate a quantized level by quantizingthe transform coefficient or the residual signal according to aparameter, and output the generated quantized level. Herein, thequantization unit 140 may quantize the transform coefficient by using aquantization matrix.

The entropy encoding unit 150 may generate a bitstream by performingentropy encoding according to a probability distribution on valuescalculated by the quantization unit 140 or on coding parameter valuescalculated when performing encoding, and output the generated bitstream.The entropy encoding unit 150 may perform entropy encoding of sampleinformation of an image and information for decoding an image. Forexample, the information for decoding the image may include a syntaxelement.

When entropy encoding is applied, symbols are represented so that asmaller number of bits are assigned to a symbol having a high chance ofbeing generated and a larger number of bits are assigned to a symbolhaving a low chance of being generated, and thus, the size of bit streamfor symbols to be encoded may be decreased. The entropy encoding unit150 may use an encoding method for entropy encoding such as exponentialGolomb, context-adaptive variable length coding (CAVLC),context-adaptive binary arithmetic coding (CABAC), etc. For example, theentropy encoding unit 150 may perform entropy encoding by using avariable length coding/code (VLC) table. In addition, the entropyencoding unit 150 may deduce a binarization method of a target symboland a probability model of a target symbol/bin, and perform arithmeticcoding by using the deduced binarization method, and a context model.

In order to encode a transform coefficient level (quantized level), theentropy encoding unit 150 may change a two-dimensional block formcoefficient into a one-dimensional vector form by using a transformcoefficient scanning method.

A coding parameter may include information (flag, index, etc.) such assyntax element that is encoded in an encoder and signaled to a decoder,and information derived when performing encoding or decoding. The codingparameter may mean information required when encoding or decoding animage. For example, at least one value or a combination form of aunit/block size, a unit/block depth, unit/block partition information,unit/block shape, unit/block partition structure, whether to partitionof a quad-tree form, whether to partition of a binary-tree form, apartition direction of a binary-tree form (horizontal direction orvertical direction), a partition form of a binary-tree form (symmetricpartition or asymmetric partition), whether or not a current coding unitis partitioned by ternary tree partitioning, direction (horizontal orvertical direction) of the ternary tree partitioning, type (symmetric orasymmetric type) of the ternary tree partitioning, whether a currentcoding unit is partitioned by multi-type tree partitioning, direction(horizontal or vertical direction) of the multi-type three partitioning,type (symmetric or asymmetric type) of the multi-type tree partitioning,and a tree (binary tree or ternary tree) structure of the multi-typetree partitioning, a prediction mode (intra prediction or interprediction), a luma intra-prediction mode/direction, a chromaintra-prediction mode/direction, intra partition information, interpartition information, a coding block partition flag, a prediction blockpartition flag, a transform block partition flag, a reference samplefiltering method, a reference sample filter tab, a reference samplefilter coefficient, a prediction block filtering method, a predictionblock filter tap, a prediction block filter coefficient, a predictionblock boundary filtering method, a prediction block boundary filter tab,a prediction block boundary filter coefficient, an intra-predictionmode, an inter-prediction mode, motion information, a motion vector, amotion vector difference, a reference picture index, a inter-predictionangle, an inter-prediction indicator, a prediction list utilizationflag, a reference picture list, a reference picture, a motion vectorpredictor index, a motion vector predictor candidate, a motion vectorcandidate list, whether to use a merge mode, a merge index, a mergecandidate, a merge candidate list, whether to use a skip mode, aninterpolation filter type, an interpolation filter tab, an interpolationfilter coefficient, a motion vector size, a presentation accuracy of amotion vector, a transform type, a transform size, information ofwhether or not a primary (first) transform is used, information ofwhether or not a secondary transform is used, a primary transform index,a secondary transform index, information of whether or not a residualsignal is present, a coded block pattern, a coded block flag (CBF), aquantization parameter, a quantization parameter residue, a quantizationmatrix, whether to apply an intra loop filter, an intra loop filtercoefficient, an intra loop filter tab, an intra loop filter shape/form,whether to apply a deblocking filter, a deblocking filter coefficient, adeblocking filter tab, a deblocking filter strength, a deblocking filtershape/form, whether to apply an adaptive sample offset, an adaptivesample offset value, an adaptive sample offset category, an adaptivesample offset type, whether to apply an adaptive loop filter, anadaptive loop filter coefficient, an adaptive loop filter tab, anadaptive loop filter shape/form, a binarization/inverse-binarizationmethod, a context model determining method, a context model updatingmethod, whether to perform a regular mode, whether to perform a bypassmode, a context bin, a bypass bin, a significant coefficient flag, alast significant coefficient flag, a coded flag for a unit of acoefficient group, a position of the last significant coefficient, aflag for whether a value of a coefficient is larger than 1, a flag forwhether a value of a coefficient is larger than 2, a flag for whether avalue of a coefficient is larger than 3, information on a remainingcoefficient value, a sign information, a reconstructed luma sample, areconstructed chroma sample, a residual luma sample, a residual chromasample, a luma transform coefficient, a chroma transform coefficient, aquantized luma level, a quantized chroma level, a transform coefficientlevel scanning method, a size of a motion vector search area at adecoder side, a shape of a motion vector search area at a decoder side,a number of time of a motion vector search at a decoder side,information on a CTU size, information on a minimum block size,information on a maximum block size, information on a maximum blockdepth, information on a minimum block depth, an imagedisplaying/outputting sequence, slice identification information, aslice type, slice partition information, tile identificationinformation, a tile type, tile partition information, a picture type, abit depth of an input sample, a bit depth of a reconstruction sample, abit depth of a residual sample, a bit depth of a transform coefficient,a bit depth of a quantized level, and information on a luma signal orinformation on a chroma signal may be included in the coding parameter.

Herein, signaling the flag or index may mean that a corresponding flagor index is entropy encoded and included in a bitstream by an encoder,and may mean that the corresponding flag or index is entropy decodedfrom a bitstream by a decoder.

When the encoding apparatus 100 performs encoding throughinter-prediction, an encoded current image may be used as a referenceimage for another image that is processed afterwards. Accordingly, theencoding apparatus 100 may reconstruct or decode the encoded currentimage, or store the reconstructed or decoded image as a reference imagein reference picture buffer 190.

A quantized level may be dequantized in the dequantization unit 160, ormay be inverse-transformed in the inverse-transform unit 170. Adequantized or inverse-transformed coefficient or both may be added witha prediction block by the adder 175. By adding the dequantized orinverse-transformed coefficient or both with the prediction block, areconstructed block may be generated. Herein, the dequantized orinverse-transformed coefficient or both may mean a coefficient on whichat least one of dequantization and inverse-transform is performed, andmay mean a reconstructed residual block.

A reconstructed block may pass through the filter unit 180. The filterunit 180 may apply at least one of a deblocking filter, a sampleadaptive offset (SAO), and an adaptive loop filter (ALF) to areconstructed sample, a reconstructed block or a reconstructed image.The filter unit 180 may be called as an in-loop filter.

The deblocking filter may remove block distortion generated inboundaries between blocks. In order to determine whether or not to applya deblocking filter, whether or not to apply a deblocking filter to acurrent block may be determined based samples included in several rowsor columns which are included in the block. When a deblocking filter isapplied to a block, another filter may be applied according to arequired deblocking filtering strength.

In order to compensate an encoding error, a proper offset value may beadded to a sample value by using a sample adaptive offset. The sampleadaptive offset may correct an offset of a deblocked image from anoriginal image by a sample unit. A method of partitioning samples of animage into a predetermined number of regions, determining a region towhich an offset is applied, and applying the offset to the determinedregion, or a method of applying an offset in consideration of edgeinformation on each sample may be used.

The adaptive loop filter may perform filtering based on a comparisonresult of the filtered reconstructed image and the original image.Samples included in an image may be partitioned into predeterminedgroups, a filter to be applied to each group may be determined, anddifferential filtering may be performed for each group. Information ofwhether or not to apply the ALF may be signaled by coding units (CUs),and a form and coefficient of the ALF to be applied to each block mayvary.

The reconstructed block or the reconstructed image having passed throughthe filter unit 180 may be stored in the reference picture buffer 190. Areconstructed block processed by the filter unit 180 may be a part of areference image. That is, a reference image is a reconstructed imagecomposed of reconstructed blocks processed by the filter unit 180. Thestored reference image may be used later in inter prediction or motioncompensation.

FIG. 2 is a block diagram showing a configuration of a decodingapparatus according to an embodiment and to which the present inventionis applied.

A decoding apparatus 200 may a decoder, a video decoding apparatus, oran image decoding apparatus.

Referring to FIG. 2 , the decoding apparatus 200 may include an entropydecoding unit 210, a dequantization unit 220, a inverse-transform unit230, an intra-prediction unit 240, a motion compensation unit 250, anadder 225, a filter unit 260, and a reference picture buffer 270.

The decoding apparatus 200 may receive a bitstream output from theencoding apparatus 100. The decoding apparatus 200 may receive abitstream stored in a computer readable recording medium, or may receivea bitstream that is streamed through a wired/wireless transmissionmedium. The decoding apparatus 200 may decode the bitstream by using anintra mode or an inter mode. In addition, the decoding apparatus 200 maygenerate a reconstructed image generated through decoding or a decodedimage, and output the reconstructed image or decoded image.

When a prediction mode used when decoding is an intra mode, a switch maybe switched to an intra. Alternatively, when a prediction mode used whendecoding is an inter mode, a switch may be switched to an inter mode.

The decoding apparatus 200 may obtain a reconstructed residual block bydecoding the input bitstream, and generate a prediction block. When thereconstructed residual block and the prediction block are obtained, thedecoding apparatus 200 may generate a reconstructed block that becomes adecoding target by adding the reconstructed residual block with theprediction block. The decoding target block may be called a currentblock.

The entropy decoding unit 210 may generate symbols by entropy decodingthe bitstream according to a probability distribution. The generatedsymbols may include a symbol of a quantized level form. Herein, anentropy decoding method may be a inverse-process of the entropy encodingmethod described above.

In order to decode a transform coefficient level (quantized level), theentropy decoding unit 210 may change a one-directional vector formcoefficient into a two-dimensional block form by using a transformcoefficient scanning method.

A quantized level may be dequantized in the dequantization unit 220, orinverse-transformed in the inverse-transform unit 230. The quantizedlevel may be a result of dequantizing or inverse-transforming or both,and may be generated as a reconstructed residual block. Herein, thedequantization unit 220 may apply a quantization matrix to the quantizedlevel.

When an intra mode is used, the intra-prediction unit 240 may generate aprediction block by performing, for the current block, spatialprediction that uses a sample value of a block adjacent to a decodingtarget block and which has been already decoded.

When an inter mode is used, the motion compensation unit 250 maygenerate a prediction block by performing, for the current block, motioncompensation that uses a motion vector and a reference image stored inthe reference picture buffer 270.

The adder 225 may generate a reconstructed block by adding thereconstructed residual block with the prediction block. The filter unit260 may apply at least one of a deblocking filter, a sample adaptiveoffset, and an adaptive loop filter to the reconstructed block orreconstructed image. The filter unit 260 may output the reconstructedimage. The reconstructed block or reconstructed image may be stored inthe reference picture buffer 270 and used when performinginter-prediction. A reconstructed block processed by the filter unit 260may be a part of a reference image. That is, a reference image is areconstructed image composed of reconstructed blocks processed by thefilter unit 260. The stored reference image may be used later in interprediction or motion compensation.

FIG. 3 is a view schematically showing a partition structure of an imagewhen encoding and decoding the image. FIG. 3 schematically shows anexample of partitioning a single unit into a plurality of lower units.

In order to efficiently partition an image, when encoding and decoding,a coding unit (CU) may be used. The coding unit may be used as a basicunit when encoding/decoding the image. In addition, the coding unit maybe used as a unit for distinguishing an intra prediction mode and aninter prediction mode when encoding/decoding the image. The coding unitmay be a basic unit used for prediction, transform, quantization,inverse-transform, dequantization, or an encoding/decoding process of atransform coefficient.

Referring to FIG. 3 , an image 300 is sequentially partitioned in alargest coding unit (LCU), and a LCU unit is determined as a partitionstructure. Herein, the LCU may be used in the same meaning as a codingtree unit (CTU). A unit partitioning may mean partitioning a blockassociated with to the unit. In block partition information, informationof a unit depth may be included. Depth information may represent anumber of times or a degree or both in which a unit is partitioned. Asingle unit may be partitioned into a plurality of lower level unitshierarchically associated with depth information based on a treestructure. In other words, a unit and a lower level unit generated bypartitioning the unit may correspond to a node and a child node of thenode, respectively. Each of partitioned lower unit may have depthinformation. Depth information may be information representing a size ofa CU, and may be stored in each CU. Unit depth represents times and/ordegrees related to partitioning a unit. Therefore, partitioninginformation of a lower-level unit may comprise information on a size ofthe lower-level unit.

A partition structure may mean a distribution of a coding unit (CU)within an LCU 310. Such a distribution may be determined according towhether or not to partition a single CU into a plurality (positiveinteger equal to or greater than 2 including 2, 4, 8, 16, etc.) of CUs.A horizontal size and a vertical size of the CU generated bypartitioning may respectively be half of a horizontal size and avertical size of the CU before partitioning, or may respectively havesizes smaller than a horizontal size and a vertical size beforepartitioning according to a number of times of partitioning. The CU maybe recursively partitioned into a plurality of CUs. By the recursivepartitioning, at least one among a height and a width of a CU afterpartitioning may decrease comparing with at least one among a height anda width of a CU before partitioning. Partitioning of the CU may berecursively performed until to a predefined depth or predefined size.For example, a depth of an LCU may be 0, and a depth of a smallestcoding unit (SCU) may be a predefined maximum depth. Herein, the LCU maybe a coding unit having a maximum coding unit size, and the SCU may be acoding unit having a minimum coding unit size as described above.Partitioning is started from the LCU 310, a CU depth increases by 1 as ahorizontal size or a vertical size or both of the CU decreases bypartitioning. For example, for each depth, a CU which is not partitionedmay have a size of 2N×2N. Also, in case of a CU which is partitioned, aCU with a size of 2N×2N may be partitioned into four CUs with a size ofN×N. A size of N may decrease to half as a depth increase by 1.

In addition, information whether or not the CU is partitioned may berepresented by using partition information of the CU. The partitioninformation may be 1-bit information. All CUs, except for a SCU, mayinclude partition information. For example, when a value of partitioninformation is 1, the CU may not be partitioned, when a value ofpartition information is 2, the CU may be partitioned.

Referring to FIG. 3 , an LCU having a depth 0 may be a 64×64 block. 0may be a minimum depth. A SCU having a depth 3 may be an 8×8 block. 3may be a maximum depth. A CU of a 32×32 block and a 16×16 block may berespectively represented as a depth 1 and a depth 2.

For example, when a single coding unit is partitioned into four codingunits, a horizontal size and a vertical size of the four partitionedcoding units may be a half size of a horizontal and vertical size of theCU before being partitioned. In one embodiment, when a coding unithaving a 32×32 size is partitioned into four coding units, each of thefour partitioned coding units may have a 16×16 size. When a singlecoding unit is partitioned into four coding units, it may be called thatthe coding unit may be partitioned into a quad-tree form.

For example, when one coding unit is partitioned into two sub-codingunits, the horizontal or vertical size (width or height) of each of thetwo sub-coding units may be half the horizontal or vertical size of theoriginal coding unit. For example, when a coding unit having a size of32×32 is vertically partitioned into two sub-coding units, each of thetwo sub-coding units may have a size of 16×32. For example, when acoding unit having a size of 8×32 is horizontally partitioned into twosub-coding units, each of the two sub-coding units may have a size of8×16. When one coding unit is partitioned into two sub-coding units, itcan be said that the coding unit is binary-partitioned or is partitionedby a binary tree partition structure.

For example, when one coding unit is partitioned into three sub-codingunits, the horizontal or vertical size of the coding unit can bepartitioned with a ratio of 1:2:1, thereby producing three sub-codingunits whose horizontal or vertical sizes are in a ratio of 1:2:1. Forexample, when a coding unit having a size of 16×32 is horizontallypartitioned into three sub-coding units, the three sub-coding units mayhave sizes of 16×8, 16×16, and 16×8 respectively, in the order from theuppermost to the lowermost sub-coding unit. For example, when a codingunit having a size of 32×32 is vertically split into three sub-codingunits, the three sub-coding units may have sizes of 8×32, 16×32, and8×32, respectively in the order from the left to the right sub-codingunit. When one coding unit is partitioned into three sub-coding units,it can be said that the coding unit is ternary-partitioned orpartitioned by a ternary tree partition structure.

In FIG. 3 , a coding tree unit (CTU) 320 is an example of a CTU to whicha quad tree partition structure, a binary tree partition structure, anda ternary tree partition structure are all applied.

As described above, in order to partition the CTU, at least one of aquad tree partition structure, a binary tree partition structure, and aternary tree partition structure may be applied. Various tree partitionstructures may be sequentially applied to the CTU, according to apredetermined priority order. For example, the quad tree partitionstructure may be preferentially applied to the CTU. A coding unit thatcannot be partitioned any longer using a quad tree partition structuremay correspond to a leaf node of a quad tree. A coding unitcorresponding to a leaf node of a quad tree may serve as a root node ofa binary and/or ternary tree partition structure. That is, a coding unitcorresponding to a leaf node of a quad tree may be further partitionedby a binary tree partition structure or a ternary tree partitionstructure, or may not be further partitioned. Therefore, by preventing acoding block that results from binary tree partitioning or ternary treepartitioning of a coding unit corresponding to a leaf node of a quadtree from undergoing further quad tree partitioning, block partitioningand/or signaling of partition information can be effectively performed.

The fact that a coding unit corresponding to a node of a quad tree ispartitioned may be signaled using quad partition information. The quadpartition information having a first value (e.g., “1”) may indicate thata current coding unit is partitioned by the quad tree partitionstructure. The quad partition information having a second value (e.g.,“0”) may indicate that a current coding unit is not partitioned by thequad tree partition structure. The quad partition information may be aflag having a predetermined length (e.g., one bit).

There may not be a priority between the binary tree partitioning and theternary tree partitioning. That is, a coding unit corresponding to aleaf node of a quad tree may further undergo arbitrary partitioningamong the binary tree partitioning and the ternary tree partitioning. Inaddition, a coding unit generated through the binary tree partitioningor the ternary tree partitioning may undergo a further binary treepartitioning or a further ternary tree partitioning, or may not befurther partitioned.

A tree structure in which there is no priority among the binary treepartitioning and the ternary tree partitioning is referred to as amulti-type tree structure. A coding unit corresponding to a leaf node ofa quad tree may serve as a root node of a multi-type tree. Whether topartition a coding unit which corresponds to a node of a multi-type treemay be signaled using at least one of multi-type tree partitionindication information, partition direction information, and partitiontree information. For partitioning of a coding unit corresponding to anode of a multi-type tree, the multi-type tree partition indicationinformation, the partition direction information, and the partition treeinformation may be sequentially signaled.

The multi-type tree partition indication information having a firstvalue (e.g., “1”) may indicate that a current coding unit is to undergoa multi-type tree partitioning. The multi-type tree partition indicationinformation having a second value (e.g., “0”) may indicate that acurrent coding unit is not to undergo a multi-type tree partitioning.

When a coding unit corresponding to a node of a multi-type tree isfurther partitioned by a multi-type tree partition structure, the codingunit may include partition direction information. The partitiondirection information may indicate in which direction a current codingunit is to be partitioned for the multi-type tree partitioning. Thepartition direction information having a first value (e.g., “1”) mayindicate that a current coding unit is to be vertically partitioned. Thepartition direction information having a second value (e.g., “0”) mayindicate that a current coding unit is to be horizontally partitioned.

When a coding unit corresponding to a node of a multi-type tree isfurther partitioned by a multi-type tree partition structure, thecurrent coding unit may include partition tree information. Thepartition tree information may indicate a tree partition structure whichis to be used for partitioning of a node of a multi-type tree. Thepartition tree information having a first value (e.g., “1”) may indicatethat a current coding unit is to be partitioned by a binary treepartition structure. The partition tree information having a secondvalue (e.g., “0”) may indicate that a current coding unit is to bepartitioned by a ternary tree partition structure.

The partition indication information, the partition tree information,and the partition direction information may each be a flag having apredetermined length (e.g., one bit).

At least any one of the quadtree partition indication information, themulti-type tree partition indication information, the partitiondirection information, and the partition tree information may be entropyencoded/decoded. For the entropy-encoding/decoding of those types ofinformation, information on a neighboring coding unit adjacent to thecurrent coding unit may be used. For example, there is a highprobability that the partition type (the partitioned or non-partitioned,the partition tree, and/or the partition direction) of a leftneighboring coding unit and/or an upper neighboring coding unit of acurrent coding unit is similar to that of the current coding unit.Therefore, context information for entropy encoding/decoding of theinformation on the current coding unit may be derived from theinformation on the neighboring coding units. The information on theneighboring coding units may include at least any one of quad partitioninformation, multi-type tree partition indication information, partitiondirection information, and partition tree information.

As another example, among binary tree partitioning and ternary treepartitioning, binary tree partitioning may be preferentially performed.That is, a current coding unit may primarily undergo binary treepartitioning, and then a coding unit corresponding to a leaf node of abinary tree may be set as a root node for ternary tree partitioning. Inthis case, neither quad tree partitioning nor binary tree partitioningmay not be performed on the coding unit corresponding to a node of aternary tree.

A coding unit that cannot be partitioned by a quad tree partitionstructure, a binary tree partition structure, and/or a ternary treepartition structure becomes a basic unit for coding, prediction and/ortransformation. That is, the coding unit cannot be further partitionedfor prediction and/or transformation. Therefore, the partition structureinformation and the partition information used for partitioning a codingunit into prediction units and/or transformation units may not bepresent in a bit stream.

However, when the size of a coding unit (i.e., a basic unit forpartitioning) is larger than the size of a maximum transformation block,the coding unit may be recursively partitioned until the size of thecoding unit is reduced to be equal to or smaller than the size of themaximum transformation block. For example, when the size of a codingunit is 64×64 and when the size of a maximum transformation block is32×32, the coding unit may be partitioned into four 32×32 blocks fortransformation. For example, when the size of a coding unit is 32×64 andthe size of a maximum transformation block is 32×32, the coding unit maybe partitioned into two 32×32 blocks for the transformation. In thiscase, the partitioning of the coding unit for transformation is notsignaled separately, and may be determined through comparison betweenthe horizontal or vertical size of the coding unit and the horizontal orvertical size of the maximum transformation block. For example, when thehorizontal size (width) of the coding unit is larger than the horizontalsize (width) of the maximum transformation block, the coding unit may bevertically bisected. For example, when the vertical size (length) of thecoding unit is larger than the vertical size (length) of the maximumtransformation block, the coding unit may be horizontally bisected.

Information of the maximum and/or minimum size of the coding unit andinformation of the maximum and/or minimum size of the transformationblock may be signaled or determined at an upper level of the codingunit. The upper level may be, for example, a sequence level, a picturelevel, a slice level, or the like. For example, the minimum size of thecoding unit may be determined to be 4×4. For example, the maximum sizeof the transformation block may be determined to be 64×64. For example,the minimum size of the transformation block may be determined to be4×4.

Information of the minimum size (quad tree minimum size) of a codingunit corresponding to a leaf node of a quad tree and/or information ofthe maximum depth (the maximum tree depth of a multi-type tree) from aroot node to a leaf node of the multi-type tree may be signaled ordetermined at an upper level of the coding unit. For example, the upperlevel may be a sequence level, a picture level, a slice level, or thelike. Information of the minimum size of a quad tree and/or informationof the maximum depth of a multi-type tree may be signaled or determinedfor each of an intra-picture slice and an inter-picture slice.

Difference information between the size of a CTU and the maximum size ofa transformation block may be signaled or determined at an upper levelof the coding unit. For example, the upper level may be a sequencelevel, a picture level, a slice level, or the like. Information of themaximum size of the coding units corresponding to the respective nodesof a binary tree (hereinafter, referred to as a maximum size of a binarytree) may be determined based on the size of the coding tree unit andthe difference information. The maximum size of the coding unitscorresponding to the respective nodes of a ternary tree (hereinafter,referred to as a maximum size of a ternary tree) may vary depending onthe type of slice. For example, for an intra-picture slice, the maximumsize of a ternary tree may be 32×32. For example, for an inter-pictureslice, the maximum size of a ternary tree may be 128×128. For example,the minimum size of the coding units corresponding to the respectivenodes of a binary tree (hereinafter, referred to as a minimum size of abinary tree) and/or the minimum size of the coding units correspondingto the respective nodes of a ternary tree (hereinafter, referred to as aminimum size of a ternary tree) may be set as the minimum size of acoding block.

As another example, the maximum size of a binary tree and/or the maximumsize of a ternary tree may be signaled or determined at the slice level.Alternatively, the minimum size of the binary tree and/or the minimumsize of the ternary tree may be signaled or determined at the slicelevel.

Depending on size and depth information of the above-described variousblocks, quad partition information, multi-type tree partition indicationinformation, partition tree information and/or partition directioninformation may be included or may not be included in a bit stream.

For example, when the size of the coding unit is not larger than theminimum size of a quad tree, the coding unit does not contain quadpartition information. Thus, the quad partition information may bededuced from a second value.

For example, when the sizes (horizontal and vertical sizes) of a codingunit corresponding to a node of a multi-type tree are larger than themaximum sizes (horizontal and vertical sizes) of a binary tree and/orthe maximum sizes (horizontal and vertical sizes) of a ternary tree, thecoding unit may not be binary-partitioned or ternary-partitioned.Accordingly, the multi-type tree partition indication information maynot be signaled but may be deduced from a second value.

Alternatively, when the sizes (horizontal and vertical sizes) of acoding unit corresponding to a node of a multi-type tree are the same asthe maximum sizes (horizontal and vertical sizes) of a binary treeand/or are two times as large as the maximum sizes (horizontal andvertical sizes) of a ternary tree, the coding unit may not be furtherbinary-partitioned or ternary-partitioned. Accordingly, the multi-typetree partition indication information may not be signaled but be derivedfrom a second value. This is because when a coding unit is partitionedby a binary tree partition structure and/or a ternary tree partitionstructure, a coding unit smaller than the minimum size of a binary treeand/or the minimum size of a ternary tree is generated.

Alternatively, when the depth of a coding unit corresponding to a nodeof a multi-type tree is equal to the maximum depth of the multi-typetree, the coding unit may not be further binary-partitioned and/orternary-partitioned. Accordingly, the multi-type tree partitionindication information may not be signaled but may be deduced from asecond value.

Alternatively, only when at least one of vertical direction binary treepartitioning, horizontal direction binary tree partitioning, verticaldirection ternary tree partitioning, and horizontal direction ternarytree partitioning is possible for a coding unit corresponding to a nodeof a multi-type tree, the multi-type tree partition indicationinformation may be signaled. Otherwise, the coding unit may not bebinary-partitioned and/or ternary-partitioned. Accordingly, themulti-type tree partition indication information may not be signaled butmay be deduced from a second value.

Alternatively, only when both of the vertical direction binary treepartitioning and the horizontal direction binary tree partitioning orboth of the vertical direction ternary tree partitioning and thehorizontal direction ternary tree partitioning are possible for a codingunit corresponding to a node of a multi-type tree, the partitiondirection information may be signaled. Otherwise, the partitiondirection information may not be signaled but may be derived from avalue indicating possible partitioning directions.

Alternatively, only when both of the vertical direction binary treepartitioning and the vertical direction ternary tree partitioning orboth of the horizontal direction binary tree partitioning and thehorizontal direction ternary tree partitioning are possible for a codingtree corresponding to a node of a multi-type tree, the partition treeinformation may be signaled. Otherwise, the partition tree informationmay not be signaled but be deduced from a value indicating a possiblepartitioning tree structure.

FIG. 4 is a view showing an intra-prediction process.

Arrows from center to outside in FIG. 4 may represent predictiondirections of intra prediction modes.

Intra encoding and/or decoding may be performed by using a referencesample of a neighbor block of the current block. A neighbor block may bea reconstructed neighbor block. For example, intra encoding and/ordecoding may be performed by using an encoding parameter or a value of areference sample included in a reconstructed neighbor block.

A prediction block may mean a block generated by performing intraprediction. A prediction block may correspond to at least one among CU,PU and TU. A unit of a prediction block may have a size of one among CU,PU and TU. A prediction block may be a square block having a size of2×2, 4×4, 16×16, 32×32 or 64×64 etc. or may be a rectangular blockhaving a size of 2×8, 4×8, 2×16, 4×16 and 8×16 etc.

Intra prediction may be performed according to intra prediction mode forthe current block. The number of intra prediction modes which thecurrent block may have may be a fixed value and may be a valuedetermined differently according to an attribute of a prediction block.For example, an attribute of a prediction block may comprise a size of aprediction block and a shape of a prediction block, etc.

The number of intra-prediction modes may be fixed to N regardless of ablock size. Or, the number of intra prediction modes may be 3, 5, 9, 17,34, 35, 36, 65, or 67 etc. Alternatively, the number of intra-predictionmodes may vary according to a block size or a color component type orboth. For example, the number of intra prediction modes may varyaccording to whether the color component is a luma signal or a chromasignal. For example, as a block size becomes large, a number ofintra-prediction modes may increase. Alternatively, a number ofintra-prediction modes of a luma component block may be larger than anumber of intra-prediction modes of a chroma component block.

An intra-prediction mode may be a non-angular mode or an angular mode.The non-angular mode may be a DC mode or a planar mode, and the angularmode may be a prediction mode having a specific direction or angle. Theintra-prediction mode may be expressed by at least one of a mode number,a mode value, a mode numeral, a mode angle, and mode direction. A numberof intra-prediction modes may be M, which is larger than 1, includingthe non-angular and the angular mode.

In order to intra-predict a current block, a step of determining whetheror not samples included in a reconstructed neighbor block may be used asreference samples of the current block may be performed. When a samplethat is not usable as a reference sample of the current block ispresent, a value obtained by duplicating or performing interpolation onat least one sample value among samples included in the reconstructedneighbor block or both may be used to replace with a non-usable samplevalue of a sample, thus the replaced sample value is used as a referencesample of the current block.

When intra-predicting, a filter may be applied to at least one of areference sample and a prediction sample based on an intra-predictionmode and a current block size.

In case of a planar mode, when generating a prediction block of acurrent block, according to a position of a prediction target samplewithin a prediction block, a sample value of the prediction targetsample may be generated by using a weighted sum of an upper and leftside reference sample of a current sample, and a right upper side andleft lower side reference sample of the current block. In addition, incase of a DC mode, when generating a prediction block of a currentblock, an average value of upper side and left side reference samples ofthe current block may be used. In addition, in case of an angular mode,a prediction block may be generated by using an upper side, a left side,a right upper side, and/or a left lower side reference sample of thecurrent block. In order to generate a prediction sample value,interpolation of a real number unit may be performed.

An intra-prediction mode of a current block may be entropyencoded/decoded by predicting an intra-prediction mode of a blockpresent adjacent to the current block. When intra-prediction modes ofthe current block and the neighbor block are identical, information thatthe intra-prediction modes of the current block and the neighbor blockare identical may be signaled by using predetermined flag information.In addition, indicator information of an intra-prediction mode that isidentical to the intra-prediction mode of the current block amongintra-prediction modes of a plurality of neighbor blocks may besignaled. When intra-prediction modes of the current block and theneighbor block are different, intra-prediction mode information of thecurrent block may be entropy encoded/decoded by performing entropyencoding/decoding based on the intra-prediction mode of the neighborblock.

FIG. 5 is a diagram illustrating an embodiment of an inter-pictureprediction process.

In FIG. 5 , a rectangle may represent a picture. In FIG. 5 , an arrowrepresents a prediction direction. Pictures may be categorized intointra pictures (I pictures), predictive pictures (P pictures), andBi-predictive pictures (B pictures) according to the encoding typethereof.

The I picture may be encoded through intra-prediction without requiringinter-picture prediction. The P picture may be encoded throughinter-picture prediction by using a reference picture that is present inone direction (i.e., forward direction or backward direction) withrespect to a current block. The B picture may be encoded throughinter-picture prediction by using reference pictures that are present intwo directions (i.e., forward direction and backward direction) withrespect to a current block. When the inter-picture prediction is used,the encoder may perform inter-picture prediction or motion compensationand the decoder may perform the corresponding motion compensation.

Hereinbelow, an embodiment of the inter-picture prediction will bedescribed in detail.

The inter-picture prediction or motion compensation may be performedusing a reference picture and motion information.

Motion information of a current block may be derived duringinter-picture prediction by each of the encoding apparatus 100 and thedecoding apparatus 200. The motion information of the current block maybe derived by using motion information of a reconstructed neighboringblock, motion information of a collocated block (also referred to as acol block or a co-located block), and/or a block adjacent to theco-located block. The co-located block may mean a block that is locatedspatially at the same position as the current block, within a previouslyreconstructed collocated picture (also referred to as a col picture or aco-located picture). The co-located picture may be one picture among oneor more reference pictures included in a reference picture list.

A method of deriving the motion information of the current block mayvary depending on a prediction mode of the current block. For example,as prediction modes for inter-picture prediction, there may be an AMVPmode, a merge mode, a skip mode, a current picture reference mode, etc.The merge mode may be referred to as a motion merge mode.

For example, when the AMVP is used as the prediction mode, at least oneof motion vectors of the reconstructed neighboring blocks, motionvectors of the co-located blocks, motion vectors of blocks adjacent tothe co-located blocks, and a (0, 0) motion vector may be determined asmotion vector candidates for the current block, and a motion vectorcandidate list is generated by using the motion vector candidates. Themotion vector candidate of the current block can be derived by using thegenerated motion vector candidate list. The motion information of thecurrent block may be determined based on the derived motion vectorcandidate. The motion vectors of the collocated blocks or the motionvectors of the blocks adjacent to the collocated blocks may be referredto as temporal motion vector candidates, and the motion vectors of thereconstructed neighboring blocks may be referred to as spatial motionvector candidates.

The encoding apparatus 100 may calculate a motion vector difference(MVD) between the motion vector of the current block and the motionvector candidate and may perform entropy encoding on the motion vectordifference (MVD). In addition, the encoding apparatus 100 may performentropy encoding on a motion vector candidate index and generate abitstream. The motion vector candidate index may indicate an optimummotion vector candidate among the motion vector candidates included inthe motion vector candidate list. The decoding apparatus may performentropy decoding on the motion vector candidate index included in thebitstream and may select a motion vector candidate of a decoding targetblock from among the motion vector candidates included in the motionvector candidate list by using the entropy-decoded motion vectorcandidate index. In addition, the decoding apparatus 200 may add theentropy-decoded MVD and the motion vector candidate extracted throughthe entropy decoding, thereby deriving the motion vector of the decodingtarget block.

The bitstream may include a reference picture index indicating areference picture. The reference picture index may be entropy-encoded bythe encoding apparatus 100 and then signaled as a bitstream to thedecoding apparatus 200. The decoding apparatus 200 may generate aprediction block of the decoding target block based on the derivedmotion vector and the reference picture index information.

Another example of the method of deriving the motion information of thecurrent block may be the merge mode. The merge mode may mean a method ofmerging motion of a plurality of blocks. The merge mode may mean a modeof deriving the motion information of the current block from the motioninformation of the neighboring blocks. When the merge mode is applied,the merge candidate list may be generated using the motion informationof the reconstructed neighboring blocks and/or the motion information ofthe collocated blocks. The motion information may include at least oneof a motion vector, a reference picture index, and an inter-pictureprediction indicator. The prediction indicator may indicateone-direction prediction (L0 prediction or L1 prediction) ortwo-direction predictions (L0 prediction and L1 prediction).

The merge candidate list may be a list of motion information stored. Themotion information included in the merge candidate list may be at leasteither one of the zero merge candidate and new motion information thatis a combination of the motion information (spatial merge candidate) ofone neighboring block adjacent to the current block, the motioninformation (temporal merge candidate) of the collocated block of thecurrent block, which is included within the reference picture, and themotion information exiting in the merge candidate list.

The encoding apparatus 100 may generate a bitstream by performingentropy encoding on at least one of a merge flag and a merge index andmay signal the bitstream to the decoding apparatus 200. The merge flagmay be information indicating whether or not to perform the merge modefor each block, and the merge index may be information indicating thatwhich neighboring block, among the neighboring blocks of the currentblock, is a merge target block. For example, the neighboring blocks ofthe current block may include a left neighboring block on the left sideof the current block, an upper neighboring block disposed above thecurrent block, and a temporal neighboring block temporally adjacent tothe current block.

The skip mode may be a mode in which the motion information of theneighboring block is applied to the current block as it is. When theskip mode is applied, the encoding apparatus 100 may perform entropyencoding on information of the fact that the motion information of whichblock is to be used as the motion information of the current block togenerate a bit stream, and may signal the bitstream to the decodingapparatus 200. The encoding apparatus 100 may not signal a syntaxelement regarding at least any one of the motion vector differenceinformation, the encoding block flag, and the transform coefficientlevel to the decoding apparatus 200.

The current picture reference mode may mean a prediction mode in which apreviously reconstructed region within a current picture to which thecurrent block belongs is used for prediction. Here, a vector may be usedto specify the previously-reconstructed region. Information indicatingwhether the current block is to be encoded in the current picturereference mode may be encoded by using the reference picture index ofthe current block. The flag or index indicating whether or not thecurrent block is a block encoded in the current picture reference modemay be signaled, and may be deduced based on the reference picture indexof the current block. In the case where the current block is encoded inthe current picture reference mode, the current picture may be added tothe reference picture list for the current block so as to be located ata fixed position or a random position in the reference picture list. Thefixed position may be, for example, a position indicated by a referencepicture index of 0, or the last position in the list. When the currentpicture is added to the reference picture list so as to be located atthe random position, the reference picture index indicating the randomposition may be signaled.

FIG. 6 is a diagram illustrating a transform and quantization process.

As illustrated in FIG. 6 , a transform and/or quantization process isperformed on a residual signal to generate a quantized level signal. Theresidual signal is a difference between an original block and aprediction block (i.e., an intra prediction block or an inter predictionblock). The prediction block is a block generated through intraprediction or inter prediction. The transform may be a primarytransform, a secondary transform, or both. The primary transform of theresidual signal results in transform coefficients, and the secondarytransform of the transform coefficients results in secondary transformcoefficients.

At least one scheme selected from among various transform schemes whichare preliminarily defined is used to perform the primary transform. Forexample, examples of the predefined transform schemes include discretecosine transform (DCT), discrete sine transform (DST), andKarhunen-Loève transform (KLT). The transform coefficients generatedthrough the primary transform may undergo the secondary transform. Thetransform schemes used for the primary transform and/or the secondarytransform may be determined according to coding parameters of thecurrent block and/or neighboring blocks of the current block.Alternatively, the transform scheme may be determined through signalingof transform information.

Since the residual signal is quantized through the primary transform andthe secondary transform, a quantized-level signal (quantizationcoefficients) is generated. The quantized level signal may be scannedaccording to at least one of a diagonal up-right scan, a vertical scan,and a horizontal scan, depending on an intra prediction mode of a blockor a block size/shape. For example, as the coefficients are scanned in adiagonal up-right scan, the coefficients in a block form change into aone-dimensional vector form. Aside from the diagonal up-right scan, thehorizontal scan of horizontally scanning a two-dimensional block form ofcoefficients or the vertical scan of vertically scanning atwo-dimensional block form of coefficients may be used depending on theintra prediction mode and/or the size of a transform block. The scannedquantized-level coefficients may be entropy-encoded to be inserted intoa bitstream.

A decoder entropy-decodes the bitstream to obtain the quantized-levelcoefficients. The quantized-level coefficients may be arranged in atwo-dimensional block form through inverse scanning. For the inversescanning, at least one of a diagonal up-right scan, a vertical scan, anda horizontal scan may be used.

The quantized-level coefficients may then be dequantized, then besecondary-inverse-transformed as necessary, and finally beprimary-inverse-transformed as necessary to generate a reconstructedresidual signal.

Hereinafter, referring to FIGS. 7 to 18 , a method of performingsub-block division or deriving prediction information between sub-blocksor both according to an embodiment of the present invention will bedescribed.

FIG. 7 is a view of a flowchart showing a method of decoding a videoaccording to an embodiment of the present invention.

Referring to FIG. 7 , in S701, the decoder may divide a coding unit intoa plurality of sub-units according to a block division structure.

Meanwhile, a block division structure may be a block division structurewhere division is performed such that at least one sub-unit having apredetermined block form is included other than square and rectangularforms.

Meanwhile, the block division structure may be a block divisionstructure where division is performed such that the coding unit isdivided to include a sub-unit having a triangular form.

Meanwhile, the triangular form may be at least one of a triangular formobtained by dividing by a diagonal boundary from the left-upper to theright-lower of the coding unit, and a triangular form obtained bydividing by a diagonal boundary from the right-upper to the left-lowerof the coding unit.

Meanwhile, the block division structure may be determined on the basisof a flag representing whether or not the coding unit is divided.

Meanwhile, the block division structure may be determined on the basisof a flag representing whether or not the coding unit is divided, and anindex representing a division type of the sub-unit.

Meanwhile, a division type of the sub-unit may represent a divisiondirection of the sub-unit.

In addition, in S702, the decoder may perform decoding based on asub-unit.

Meanwhile, the decoder may perform decoding by performing at least oneof intra-prediction and inter-prediction based on a sub-unit. Inaddition, the decoder may perform decoding by performing at least one ofinverse-transform and dequantization based on a sub-unit. In addition,the decoder may perform decoding in a unit of a lowest level sub-unit ofthe sub-unit.

A method of deriving inter-prediction information will be described.

When performing inter-prediction of a current block according to a mergemode, a merge candidate may include a spatial merge candidate, atemporal merge candidate, a sub-block based temporal merge candidate, asub-block based temporal spatial combined merge candidate, a combinedmerge candidate, a zero merge candidate, etc. A merge candidate mayinclude inter-prediction information of at least one of aninter-prediction indicator, a reference video index of a reference videolist, a motion vector, and a picture order count (POC).

A method of deriving a spatial merge candidate will be described.

From a reconstructed block spatially adjacent to a current block to beencoded/decoded, a spatial merge candidate of the current block may bederived.

FIG. 8 is a view showing a method of deriving a spatial merge candidateaccording to an embodiment of the present invention.

Referring to FIG. 8 , motion information may be derived from a blockcorresponding to at least one of a block A1 positioned at the left of acurrent block X to be encoded/decoded, a block B1 positioned at theupper of the current block X, a block B0 positioned at the right uppercorner of the current block X, a block A0 positioned at the left lowercorner of the current block X, and a block B2 positioned at the leftupper corner of the current block X. In addition, a spatial mergecandidate of the current block may be determined by using the derivedmotion information. In an example, the derived motion information may beused as a spatial merge candidate of the current block.

A spatial merge candidate may mean a block reconstructed spatiallyadjacent to a block to be encoded/decoded (or, motion information of areconstructed block that is spatially adjacent). The block may have asquare form or a non-square form. In addition, a block reconstructedspatially adjacent to a block to be encoded/decode may be divided by aunit of a lower level block (sub-block). At least one spatial mergecandidate may be derived for each lower level block.

Deriving a spatial merge candidate may mean deriving a spatial mergecandidate and adding the same to a merge candidate list. Herein, each ofmerge candidates added to a merge candidate list may have differentmotion information.

A spatial merge candidate may be derived up to maxNumSpatialMergeCand.Herein, maxNumSpatialMergeCand may be a positive integer including 0. Inan example, maxNumSpatialMVPCand may be 5. MaxNumMergeCand may be amaximum number of merge candidates that may be included in a mergecandidate list, and may be a positive integer including 0. In addition,numMergeCand may mean a number of merge candidates included in apractical merge candidate list within a predefined MaxNumMergeCand.Meanwhile, use of maxNumSpatialMergeCand, numMergeCand, MaxNumMergeCanddoes not limit the scope of the present invention. Encoding/decodingapparatuses may use the above information by using a parameter valuehaving the same meaning with numMergeCand, and MaxNumMergeCand.

A method of deriving a temporal merge candidate will be described.

A temporal merge candidate may be derived from a block temporallyadjacent to a current block to be encoded/decoded, that is, a block thatis reconstructed in a reference video (reference picture). The referencevideo temporally adjacent to the current block may mean a co-locatedvideo (co-located picture). Information of the co-located video (in anexample, at least one of an inter-prediction indicator, a referencevideo index, and motion vector information indicating a co-located blockof the current block) may be transmitted from the encoder to the decoderin at least one unit of a coding block unit within asequence/picture/slice/tile/CTU/CU. Alternatively, information of theco-located video may be implicitly derived in the encoder/decoder byusing at least one a hierarchy according to an encoding/decoding order,motion information of a current block or temporally spatially adjacentblocks that are already encoded/decoded or both (in an example, aninter-prediction indicator or a reference video index or both), aninter-prediction indicator of a co-located video in asequence/picture/slice/tile level, and reference video indexinformation.

Herein, when deriving a temporal merge candidate of a current block,selecting a co-located video or a position of a co-located block withinthe co-located video or both may be selected by using at least one ofmotion information of temporally spatially adjacent blocks that arealready encoded/decoded on the basis of a position of the current block.Thus, a block at an identical position within the co-located video maybe selected. Alternatively, from an identical position of a currentblock within a selected co-located video, a co-located block of thecurrent block may be determined as a block at a position by moving by amotion vector obtained by using at least one of motion vectorinformation of temporally spatially adjacent blocks that are alreadyencoded/decoded.

Herein, motion vector information of temporally spatially adjacentblocks that are already encoded/decoded may be at least one of a motionvector, a reference video index, an inter-prediction indicator, a POC,and information of a co-located video of a current coding picture (or,slice) level.

Deriving a temporal merge candidate may mean deriving a temporal mergecandidate, and adding the derived temporal merge candidate to a mergecandidate list when motion information of the derived temporal mergecandidate differs with the existing merge candidate list.

A temporal merge candidate may be derived up to maxNumTemporalMergeCand.Herein, maxNumTemporalMergeCand may be a positive integer including 0.In an example, maxNumTemporalMergeCand may be 1. Meanwhile, use of themaxNumTemporalMergeCand does not limit the scope of the presentinvention. Encoding/decoding apparatuses may use the above informationby using a parameter value having the same meaning withmaxNumTemporalMergeCand.

Meanwhile, prediction using a temporal merge candidate may be referredas TMVP (temporal motion vector prediction).

FIG. 9 is a view showing a method of deriving a temporal merge candidateaccording to an embodiment of the present invention.

Referring to FIG. 9 , a temporal merge candidate may be derived in ablock at a position H that is present at the outside of a co-locatedblock C positioned spatially identical to a current block X to beencoded/decoded within a reference video of a current video to beencoded/decoded, or a block at a position C3.

Herein, when a temporal merge candidate is possibly derived from a blockat a position H, the temporal merge candidate may be derived from theblock at a position H. Otherwise, when the temporal merge candidate isnot derived from the block at a position H, the temporal merge candidatemay be derived from the block at a position C3. An order of deriving thetemporal merge candidate may vary.

Meanwhile, when a predetermined position or position C3 isintra-encoded, a temporal merge candidate may be derived in a block atthe position H or position C3. A co-located block of a current block mayhave a square form or a non-square form.

When a distance between a video to which a current block is included anda reference video of the current block differs from a distance between avideo to which a co-located block is included and a reference video ofthe co-located block, a temporal merge candidate may be derived byperforming scaling for a motion vector of the co-located block. Scalingof a motion vector may be performed according to a ratio of td to tb (inan example, Ratio=(tb/td)). Herein, td may mean a difference valuebetween a POC of a co-located video (co-located picture) and a POC of areference video of a co-located block. In addition, tb may mean adifference value between a POC of a video to be encoded/decoded and aPOC of a reference video of a current block.

Deriving a sub-block based temporal merge candidate will be described.

A temporal merge candidate may be derived from a co-located sub-block tobe encoded/decoded in a sub-block unit having at least one of a size, aform, and a depth smaller than a current block. For example, thesub-block may be a block having a horizontal or vertical length smallerthan a current block, or a block having deeper depth or minimized formthan the current block, or may be a block included in the current block.

A co-located sub-block of a sub-block to be encoded/decoded may have asquare form or a non-square form. In addition, a co-located block of acurrent block may be divided by a sub-block unit having at least one ofa size, a form, and a depth smaller or deeper than the current block. Atleast one temporal merge candidate may be derived for each sub-block.

When deriving at least one temporal merge candidate by performingdivision in a sub-block unit, a temporal merge candidate may be derivedin a co-located sub-block at a position H or C3 or both described withFIG. 9 according to at least one of a size, a form, and a depth of thesub-block. Alternatively, by using motion information (in an example, atleast one of a motion vector, reference video index, an inter-predictionindicator, and a POC) stored in each sub-block unit of a co-locatedblock in association with a position moved by arbitrary motioninformation derived from neighbor blocks of a current block, at leastone temporal merge candidate may be derived.

When deriving a temporal merge candidate of a current block or asub-block of the current block, a motion vector of each reference videolist (in an example, L0 or L1 or both) obtained from a co-locatedsub-block within a co-located block may be scaled as a motion vector inassociation with an arbitrary reference video of the current block.Alternatively, a plurality of motion vectors may be obtained byperforming scaling as a motion vector in association with at least onereference video among all reference videos that are referenced by asub-block of a current block obtained from a co-located sub-block, andthen at least one prediction block using a motion vector scaled inassociation with each reference video may be obtained. In addition, aprediction block of a current block or sub-block may be obtained byusing a weighted sum of obtained prediction blocks.

Meanwhile, prediction using a sub-block based temporal merge candidatemay be referred as ATMVP (alternative temporal motion vectorprediction).

A method of deriving a sub-block based temporal spatial combined mergecandidate will be described.

A merge candidate of a current block may be derived by dividing thecurrent block into sub-blocks and by using at least one piece of motioninformation of a spatially adjacent sub-block and a co-located sub-blockwithin a co-located video for each sub-block unit which is obtained.

FIG. 10 is a view showing a method of deriving a sub-block basedtemporal spatial combined merge candidate according to an embodiment ofthe present invention.

FIG. 10 is a view showing a block structure where a shadow representedby 8×8 current blocks is divided into four 4×4 sub-blocks (that is, A,B, C, and D blocks). A sub-block based temporal spatial combined mergecandidate may be derived by using motion vector information ofsub-blocks that are temporally spatially adjacent to each sub-block.Herein, motion vector information may mean a motion vector, aninter-prediction indicator, a reference video index, a POC, etc.

In FIG. 10 , when deriving a residual signal according to motioncompensation after dividing a current block into sub-blocks, motioninformation may be obtained by performing scanning that starts at asub-block a that is the upper part of a first sub-block A from the leftto the right direction. In an example, when a first upper sub-block isencoded by using an intra-prediction method, a second upper sub-blockmay be sequentially scanned. In other words, scanning for uppersub-blocks may be performed until an upper sub-block including usablemotion vector information is found.

In addition, after obtaining usable motion information for an uppersub-block, usable motion information may be obtained by performingscanning at a sub-block c that is the left of a first sub-block A fromthe upper to the lower direction.

In addition, after obtaining spatially adjacent motion information of aleft or upper sub-block or both, temporal motion information may bederived by obtaining motion information of a co-located sub-block of acurrent sub-block or a co-located block or both.

Herein, a position of a co-located block or a sub-block of theco-located block may be motion information at a position C3 or positionH described with FIG. 9 , or may mean a co-located block at a positioncompensated by a motion vector derived adjacent to a current block or asub-block of the co-located block. At least one of motion information ofa block spatially adjacent to L0 or L1 or both and motion information ofa temporally adjacent block may be obtained by using the above method.In addition, based on the at least one piece of obtained motioninformation, a sub-block based temporal spatial combined merge candidateof a current sub-block to be encoded/decoded may be derived.

In an example, for L0 or L1 or both, scaling of a motion vector in atleast one piece of motion vector information derived in the describedtemporal/spatial sub-block for a sub-block of a current block may beperformed so as to be associated with a first reference video of thecurrent block. Subsequently, by using at least one of an average value,a maximum value, a minimum value, a median value, a weighted value, anda mode of up to three scaled motion vectors, a motion vector of a firstcurrent sub-block A or a temporal spatial combined merge candidate ofthe first sub-block A may be derived. In addition, a temporal spatialcombined merge candidate of sub-blocks B, C, and D may be derived byusing the above method.

Meanwhile, prediction using a sub-block based temporal spatial combinedmerge candidate may be referred as STMVP (spatial-temporal motion vectorprediction).

Deriving an additional merge candidate will be described.

As an additional merge candidate that may be used in the presentinvention, at least one of a modified spatial merge candidate, amodified temporal merge candidate, a combined merge candidate, and amerge candidate having a predetermined motion information value may bederived.

Herein, deriving an additional merge candidate may mean, when a mergecandidate having motion information different to a merge candidatepresent in an existing merge candidate list is present, adding thecorresponding merge candidate to the merge candidate list.

The modified spatial merge candidate may mean a merge candidate in whichmotion information of at least one of spatial merge candidate derived byusing the above method is modified.

The modified temporal merge candidate may mean a merge candidate inwhich motion information of at least one temporal merge candidatederived by using the above method is modified.

The combined merge candidate may mean a merge candidate using at leastone piece of motion information of merge candidates that are a spatialmerge candidate, a temporal merge candidate, a modified spatial mergecandidate, a modified temporal merge candidate, a combined mergecandidate, and a merge candidate having a predetermined motioninformation value which are present in a merge candidate list. Herein, acombined merge candidate may mean a combined bi-prediction mergecandidate. Meanwhile, prediction using a combined merge candidate may bereferred as CMP (combined motion prediction).

The merge candidate having a predetermined motion information value maymean a zero merge candidate having a motion vector of (0, 0). Meanwhile,prediction using a merge candidate having a predetermined motioninformation value may be referred as ZMP (zero motion prediction).

At least one of the modified spatial merge candidate, the spatial mergecandidate, the modified temporal merge candidate, the temporal mergecandidate, the combined merge candidate, the merge candidate having apredetermined motion information value may be derived for each sub-blockof a current block, and the merge candidate derived for each sub-blockmay be added to the merge candidate list.

Inter-prediction information may be derived in a sub-block unit havingat least one of a size, a form, and a depth smaller or deeper than acurrent block to be encoded/decoded. In an example, the size may mean ahorizontal or vertical size or both.

When deriving inter-prediction information in a sub-block unit of acurrent block, the encoder/decoder may derive inter-predictioninformation by using at least one of a bilateral matching method, and atemplate matching method.

When using a bilateral matching method, an initial motion vector listmay be configured. When configuring an initial motion vector list, amotion vector adjacent to a current block may be used.

In an example, an initial motion vector list may be configured by usinga prediction motion vector candidate of an AMVP mode of a current block.

In another example, an initial motion vector list may be configured byusing a merge candidate of a merge mode of a current block.

In another example, an initial motion vector list may be configured witha uni-directional motion vector of L0 or L1 of a merge mode or both of acurrent block.

In another example, an initial motion vector list may be configured witha motion vector of remaining blocks other than a merge mode of a currentblock.

In another example, an initial motion vector list may be configured bycombining at least N motion vectors of the above examples. Herein, N mayrepresent a positive integer greater than 0.

In another example, an initial motion vector list may be configured witha motion vector of one direction of List0 or List1.

FIG. 11 is a view showing a method of deriving inter-predictioninformation by using a bilateral matching method according to anembodiment of the present invention.

Referring to FIG. 11 , when a motion vector present in an initial motionvector list is an MV0 present in a L0 list, in a reference picture inthe opposite direction, an MV1 may be derived that is present on thesame trajectory with the MV0 and that indicates a block that matchesbest with a block indicated by the MV0. Herein, an MV having thesmallest SAD (sum of absolute differences) between blocks indicated bythe MV0 and the MV1 may be derived as inter-prediction information of acurrent sub-block.

FIG. 12 is a view showing a method of deriving inter-predictioninformation by using a template matching method according to anembodiment of the present invention.

By using a template defined in FIG. 12 , a neighbor block of a currentblock may be used as a template. Herein, horizontal (width) and vertical(height) sizes of a template may be the same with or differ fromhorizontal (width) and vertical (height) sizes of a current block.

In an example, an upper part of a current block (Cur block) may be usedas a template.

In another example, a left part of a current block may be used as atemplate.

In another example, a left part and an upper part of a current block maybe used as a template.

In another example, in a reference video (Ref0) of a current video (CurPic), an upper part or a left part or both of a co-located block of acurrent block may be used as a template.

In another example, an MV having the smallest SAD between a template ofa current block and a template of a reference block may be derived asinter-prediction information of a current sub-block.

When deriving inter-prediction information in a sub-block unit of acurrent block, brightness compensation may be performed. For example,change in brightness of a spatial neighbor sample of a current blockwhich is sampled in at least N samples, N being an arbitrary positiveinteger, and of a spatial neighbor sample of a reference block may beapproximated by using linear model. In addition, the linear model may beapplied to a block for which motion compensation of a current sub-blockis applied so as to perform brightness compensation.

When deriving inter-prediction information in a sub-block unit of acurrent block, affine based spatial motion prediction and compensationmay be performed. For example, for a motion vector of left uppercoordinates of a current block and a motion vector at a right upper ofthe current block, a motion vector may be generated by using an affinetransform formula in a sub-block unit of the current block. In addition,motion compensation may be performed by using the generated motionvector.

FIG. 13 is a view showing a method of deriving inter-predictioninformation on the basis of OMBC (overlapped block motion compensation)according to an embodiment of the present invention.

When deriving inter-prediction information in sub-block unit of acurrent block, combining a block compensated by using inter-predictioninformation of a current block with at least one sub-block compensatedby using inter-prediction information of at least one of sub-blocks atleft, right, upper, and lower positions which are included in thecurrent block, a prediction block of the sub-block of the current blockbased on OBMC may be generated.

In an example, performing may be applied for only a sub-block present ata boundary position of inside of a current block.

In another example, performing may be applied for all sub-blocks insideof a current block.

In another example, performing may be applied for a sub-block present ata left boundary position of inside of a current block.

In another example, performing may be applied for a sub-block present ata right boundary position of inside of a current block.

According to an embodiment of the present invention, a video may beencoded/decoded by dividing the same by a number of sub-block units. Aunit and a block may be used having the same meaning.

FIG. 14 is a view showing quad-tree division, symmetric binary-treedivision, and asymmetric binary division according to an embodiment ofthe present invention. In FIG. 14 , w may represent a horizontal size ofa block, and h may represent a vertical size of the block.

Referring to FIG. 14 , quad-tree division is a division form where oneblock is divided into four sub-blocks, horizontal and vertical sizes ofthe four sub-blocks may be a half of horizontal and vertical sizes of ablock before being divided.

Binary-tree division is a division form where one block is divided intotwo sub-blocks, and symmetric binary-tree division (symmetric splitting)or asymmetric binary-tree division (asymmetric splitting) may beincluded. Herein, symmetric binary-tree division may include horizontaldirectional symmetric division and vertical directional symmetricdivision. In addition, asymmetric binary-tree division may includehorizontal directional asymmetric division or vertical directionalasymmetric division or both. Meanwhile, a leaf node of a binary-tree maymean a CU.

Nodes divided by a symmetric binary-tree may have identical sizes.Meanwhile, nodes divided by an asymmetric binary-tree may have differentsizes.

According to an embodiment of the present invention, as a divisionstructure, quad-tree (QT) division may be present.

Referring to FIG. 14 , one CTU may be recursively divided into aplurality of CUs by using a quad-tree structure. Whether to useintra-prediction or inter-prediction may be determined on the basis of aCU unit.

In an example, one CU may be divided into at least M PUs. Herein, M maybe a positive integer equal to or greater than 2.

In another example, one CU may be divided into at least N TUs by using aquad-tree structure. Herein, N may be a positive integer equal to orgreater than 2.

According to an embodiment of the present invention, as a divisionstructure, a binary-tree after quad-tree division may be present.Binary-tree after quad-tree division may mean a division structure wherequad-tree division is preferentially applied and then binary-treedivision is applied. Herein, a leaf node of a quad-tree or a leaf nodeof a binary-tree may mean a CU.

In an example, one CTU may be recursively divided into two or four CUsby using binary-tree after quad-tree division. Herein, when a CU isdivided into two, division may be performed by using a binary-tree (BT)structure, and when a CU is divided into four, division may be performedby using a quad-tree structure. A CU may have a square form or anon-square (rectangle) form since a CTU is divided by a quad-tree andthen a binary-tree.

When a CU is divided by using binary-tree after quad-tree division, atleast one of a first flag (information indicating whether or notquad-tree division is performed or whether or not further division isperformed or both) and a first index (information indicating of whetherhorizontal symmetric division or vertical symmetric is performed, orwhether or not further division is performed or both) may be signaled.Herein, when the first flag indicates a first value, it may indicatethat division is performed by using a quad-tree structure, and when thefirst flag indicates a second value, it may indicate that furtherdivision is not performed. In addition, when the first index indicates afirst value, it may indicate that further division is not performed,when the first index indicates a second value, it may indicatehorizontal directional symmetric division, and when the first indexindicates a third value, it may indicate vertical directional symmetricdivision. A first index may be signaled when a first flag indicates asecond value. In addition, when a CU is determined that further divisionfor the same is not possible on the basis of a size or depth of the CUor both, a first flag or a first index or both may not be signaled.

FIG. 15 is a view showing symmetric binary-tree division after quad-treedivision according to an embodiment of the present invention. In FIG. 15, QT split flag may indicate whether or not quad-tree division isperformed, BT split flag may indicate whether or not binary-treedivision is performed, and BT split type may indicate whether horizontaldivision (or horizontal directional division) or vertical division (orvertical directional division) is performed.

Referring to FIG. 15 , one CTU may be divided by using a quad-treestructure. In addition, a leaf node of a quad-tree may be additionallydivided by using a binary-tree structure. Herein, a leaf node of aquad-tree or a leaf node of a binary-tree may mean a CU.

In a binary-tree after quad-tree division structure, a CU may be used asa unit for performing prediction and transform without additionallydividing the same. In other words, in a binary-tree after quad-treedivision structure, a CU, a PU, and a TU may have the same size. Inaddition, whether to use intra-prediction or inter-prediction may bedetermined in a CU unit. In other words, in a binary-tree afterquad-tree division structure, at least one of intra-prediction,inter-prediction, transform, inverse-transform, quantization,dequantization, entropy encoding/decoding, and in-loop filtering may beperformed in a square block or non-square (rectangle) block unit.

A CU may include one luma (Y) component block and two chroma (Cb/Cr)component blocks. In addition, a CU may include one luma componentblock, or two chroma component blocks. In addition, a CU may include oneluma component, a Cr chroma component block, or a Cb chroma componentblock.

According to an embodiment of the present invention, a quad-tree afterbinary-tree division may be present as a division structure.

According to an embodiment of the present invention, combined quad-treeand binary-tree division may be present as a division structure.Combined quad-tree and binary-tree division may mean a divisionstructure where quad-tree division and binary-tree division are appliedwithout priority. In binary-tree after quad-tree division describedabove, quad-tree division is preferentially applied.

However, in combined quad-tree and binary-tree division, quad-treedivision is not precedent and binary-tree division may be applied first.

One CTU may be recursively divided into two or four CUs by using acombined quad-tree and binary-tree division structure. In a combinedquad-tree and binary-tree division structure, quad-tree division orbinary-tree division may be applied for one CU. Herein, when a CU isdivided into two, division may be performed by using a binary-tree, andwhen a CU is divided into four, division may be performed by using aquad-tree. In addition, since a CU is obtained by dividing a CTU byusing a combined quad-tree and binary-tree structure, the CU may have asquare or non-square (rectangle) form.

By using a block division structure of a combined quad-tree andbinary-tree form, a video may be encoded/decoded in all non-square blockforms having predetermined horizontal and vertical sizes or greater.

A luma signal and a chroma signal within a CTU may be divided by blockdivision structures different from each other. For example, in case of aspecific slice (I slice), a luma signal and a chroma signal within a CTUmay be divided by block division structures different from each other.In case of other slice (P or B slice), a luma signal and a chroma signalwithin a CTU may be divided by an identical block division structure.Herein, a Cb signal and a Cr signal may use a different intra-predictionmode, and an intra-prediction mode of each of the Cb signal and the Crsignal may be entropy encoded/decoded. An intra-prediction mode of a Cbsignal may be entropy encoded/decoded by using an intra-prediction modeof a Cr signal. Conversely, an intra-prediction mode of a Cr signal maybe entropy encoded/decoded by using an intra-prediction mode of a Cbsignal.

A method of deriving intra-prediction or inter-prediction information orboth based on a sub-block will be described.

Hereinafter, a sub-block division method will be described.

A current block (CU) may have a square or rectangle form or both, andmay mean a leaf node of at least one of a quad-tree, a binary-tree, anda three-division tree. In addition, at least one of intra-prediction orinter-prediction or both, primary/secondary transform andinverse-transform, quantization, dequantization, entropyencoding/decoding, and in-loop filtering encoding/decoding may beperformed according to at least one of a size, a form, and a depth of acurrent block (CU).

A current block may be divided into at least one of a symmetric orasymmetric sub-block or both. Intra-prediction or inter-predictioninformation or both may be derived for each sub-block. Herein, asymmetric sub-block may mean a sub-block obtained by using at least oneof quad-tree, binary-tree, and three-division tree division structuresdescribed with FIG. 14 . Meanwhile, an asymmetric sub-block may mean asub-block obtained by using a division structure that will be describedwith FIG. 16 , but it is not limited thereto. An asymmetric sub-blockmay mean at least one sub-block having a form other than a square orrectangle form or both among sub-blocks.

In FIG. 16 , when a current block is divided into two sub-blocks, thetwo sub-blocks may be defined as a first sub-block, and a secondsub-block, respectively. Meanwhile, the first sub-block may be called asub-block A, and the second sub-block may be called a sub-block B.

When a current block is divided into at least one of a symmetric orasymmetric sub-block or both, a minimum size of the sub-block may bedefined as M×N. Herein, M and N may respectively mean a positive integergreater than 0. In addition, M and N may have the same or differentvalues from each other. In an example, a 4×4 block may be defined as aminimum-size sub-block.

When a current block is divided into at least one of a symmetric orasymmetric sub-block or both, block division may not be furtherperformed for a specific block size or specific block depth orsmaller/deeper. Information of the specific block size or specific blockdepth may be entropy encoded/decoded in a unit of at least one of a videparameter set (VPS), a sequence parameter set (SPS), a picture parameterset (PPS), a tile header, a slice header, a CTU, and a CU.

Information of the specific block size or specific block depth may beentropy encoded/decoded for each of luma and chroma signals, and mayhave parameter values different from each other.

Information of the specific block size or specific block depth may beentropy encoded/decoded for each of Cb and Cr signals, and may havedifferent parameter values.

Information of the specific block size of specific block depth may beentropy encoded/decoded for each upper level, and may have differentparameter values.

Information of the specific block size or specific block depth may bedetermined on the basis of comparison between a size of a current blockor a depth of the current block and a predetermined threshold value. Apredetermined threshold value may mean a reference size or depthdetermining a block structure. In addition, a predetermined thresholdvalue may be represented in a form of at least one of a minimum valueand a maximum value of the reference size or depth. In addition, apredetermined threshold value may be a value predefined in theencoder/decoder, may be variably derived on a basis of a codingparameter of a current block, or may be signaled through a bitstream.

In an example, when a size or depth of a current block is equal to orsmaller or equal to or greater or both than a predetermined threshold,dividing the current block into at least one sub-block may not beperformed. For example, when the sum of horizontal and vertical lengthsof a current block is equal to or smaller than a predetermined thresholdvalue, dividing the current block into at least one sub-block may not beperformed.

In another example, when a size or depth of a current block is smalleror greater or both than a predetermined threshold value, dividing thecurrent block into at least one sub-block may not be performed. Forexample, when the sum of horizontal and vertical lengths of a currentblock is smaller than a predetermined threshold value, dividing thecurrent block into at least one sub-block may not be performed.

In another example, when a current block is a quad-tree leaf node havinga depth of a predetermined threshold value, dividing the current blockinto at least one sub-block may not be performed.

In another example, when a current block is a binary-tree leaf nodehaving a depth of a predetermined threshold value, dividing the currentblock into at least one sub-block may not be performed.

In another example, when a current block is a leaf node of at least oneof a quad-tree, a binary-tree, and a three-division tree performingmotion prediction/compensation by using an affine transform formula,dividing the current block into at least one sub-block or dividing thecurrent block into an asymmetric sub-block may not be performed.

In another example, when a current block is a leaf node of at least oneof a quad-tree, a binary-tree, and a three-division tree, derivinginter-prediction information by using at least one of a bilateralmatching method and a template matching method, dividing the currentblock into at least one sub-block or dividing the current block into anasymmetric sub-block may not be performed.

When a current block is divided into at least one asymmetric sub-block,at least one of sub-blocks may have an arbitrary form other than squareor rectangle.

According to the present invention, when a current block is divided intoat least one asymmetric sub-block, at least one of sub-blocks may have atriangle block form.

FIG. 16 is a view showing asymmetric division according to an embodimentof the present invention. In FIG. 16 , w may represent a horizontal sizeof a block, and h may represent a vertical size of the block.

In (a) of FIG. 16 , when a current block is divided into two sub-blocks,the current block may be divided into two sub-blocks of a triangle formobtained by dividing the current block by a diagonal boundary from theleft-upper to right-lower. Herein, remaining areas other than aright-upper area of the current block (second sub-block or sub-block B)may be defined as a first sub-block or sub-block A.

In (b) of FIG. 16 , when a current block is divided into two sub-blocks,the current block may be divided into two sub-blocks of a triangle formobtained by dividing the current block by a diagonal boundary from theright-upper to left-lower. Herein, remaining areas other than aright-lower area of the current block (second sub-block or sub-block B)may be defined as a first sub-block or sub-block A.

Referring to (a) of FIG. 16 and (b) of FIG. 16 , when a current block isdivided into four sub-blocks, the current block may be divided into fourtriangle-form sub-blocks that are obtained by dividing the current blockby a diagonal boundary from left-upper to right-lower and by a diagonalboundary from right-upper to left-lower. Alternatively, a current blockmay be divided into four triangle-form sub-blocks that are obtained bydividing the current block by a diagonal boundary from right-upper toleft-lower and by a diagonal boundary from left-upper to right-lower.

Meanwhile, dividing into a triangle-form sub-block may be applied to acase where a motion prediction/compensation method of a current block(CU) is at least one of a skip mode and a merge mode.

In (c) of FIG. 16 , when a current block is divided into two sub-blocks,remaining areas other than a right-lower area of the current block(second sub-block or sub-block B) may be defined as a first sub-block orsub-block A.

In (d) of FIG. 16 , when a current block is divided into two sub-blocks,remaining areas other than a left-lower area of the current block(second sub-block or sub-block B) may be defined as a first sub-block orsub-block A.

In (e) of FIG. 16 , when a current block is divided into two sub-blocks,remaining areas other than a right-upper area of the current block(second sub-block or sub-block B) may be defined as a first sub-block orsub-block A.

In (f) of FIG. 16 , when a current block is divided into two sub-blocks,remaining areas other than a left-upper area of the current block(second sub-block or sub-block B) may be defined as a first sub-block orsub-block A.

In (g) of FIG. 16 , when a current block is divided into two sub-blocks,an area of a 1″ form configured with a partial upper part, a partiallower part, and a partial left part of the current block may be definedas a first sub-block or sub-block A. In addition, remaining areas otherthan the first sub-block or sub-block A may be defined as a secondsub-block or sub-block B.

In (h) of FIG. 16 , when a current block is divided into two sub-blocks,an area of a 1″ form configured with a partial upper part, a partiallower part, and a partial right part of the current block may be definedas a first sub-block or sub-block A. In addition, remaining areas otherthan the first sub-block or sub-block A may be defined as a secondsub-block or sub-block B.

In (i) of FIG. 16 , when a current block is divided into two sub-blocks,an area of a “reversed-

” form configured with a partial lower part, a partial right part, and apartial left part of the current block may be defined as a firstsub-block or sub-block A. In addition, remaining areas other than thefirst sub-block or sub-block A may be defined as a second sub-block orsub-block B.

In (j) of FIG. 16 , when a current block is divided into two sub-blocks,an area of a “

” form configured with a partial upper part, a partial right part, and apartial right part of the current block may be defined as a firstsub-block or sub-block A. In addition, remaining areas other than thefirst sub-block or sub-block A may be defined as a second sub-block orsub-block B.

In (k) of FIG. 16 , when a current block is divided into two sub-blocks,remaining areas other than a center area of the current block (secondsub-block or sub-block B) may be defined as a first sub-block orsub-block A.

Meanwhile, a first sub-block (or sub-block A) and a second sub-block (orsub-block B) defined in (a) of FIG. 16 to (k) of FIG. 16 may beinterchanged from each other.

The encoder/decoder may store a table or list including a plurality ofasymmetric division forms. An asymmetric division form of a currentblock determined in the encoder may be transmitted to the decoder in anindex or flag form. Meanwhile, the encoder/decoder may determine anasymmetric division form of a current block on the basis of a codingparameter of the current block. In addition, the encoder/decoder maydetermine an asymmetric division form of a current block from a neighborblock of the current block.

When a current block is divided into at least one asymmetric sub-block,the sub-block may have a size in which a horizontal or vertical size orboth are equal to or smaller than a horizontal (h) or vertical (v) sizeor both of the current block.

In FIG. 16 , when a current block is divided into two sub-blocks, thesub-block may have a horizontal or vertical size or both being smallerthan the current block.

In (c) of FIG. 16 to (f) of FIG. 16 , when a current block is dividedinto two sub-blocks, a second sub-block may have a size in whichhorizontal and vertical sizes are (¾)×w and (¾)×h over horizontal (w)and vertical (h) sizes of the current block.

In (g) of FIG. 16 to (h) of FIG. 16 , when a current block is dividedinto two sub-blocks, a second sub-block may have a size in whichhorizontal and vertical sizes are (¾)×w and ( 2/4)×h over horizontal (w)and vertical (h) sizes of the current block.

In (i) of FIG. 16 to (j) of FIG. 16 , when a current block is dividedinto two sub-blocks, a second sub-block may have a size in whichhorizontal and vertical sizes are ( 2/4)×w and (¾)×h over horizontal (w)and vertical (h) sizes of the current block.

In (k) of FIG. 16 , a second sub-block may have a size in whichhorizontal and vertical sizes are ( 2/4)×w and ( 2/4)×h over horizontal(w) and vertical (h) sizes of the current block.

Meanwhile, a ratio of a horizontal size to a vertical size of a secondsub-block describe above may be set to a ratio predefined in the encoderand the decoder, or may be obtained on the basis of information signaledfrom the encoder to the decoder.

A current block (CU) may have a square or rectangle form or both. Inaddition, a current block may be divided into at least one asymmetricsub-block by using the above described method, so that intra-predictionor inter-prediction information or both may be derived. Herein,intra-prediction or inter-prediction information or both may be derivedfor each sub-block in a unit of a lowest level sub-block unit, and thelowest level sub-block may mean the smallest block unit having apredetermined size. For example, a block size of 4×4 blocks may bedefined as the lowest level sub-block.

In addition, size information of a lowest level sub-block may be entropyencoded/decoded in a unit of at least one of a VPS, an SPS, a PPS, atile header, a slice header, a CTU, and a CU.

A current block (CU) may mean a leaf node of at least one of aquad-tree, a binary-tree, and a three division tree, and at least one ofintra-prediction or inter-prediction or both, primary/secondarytransform and inverse-transform, quantization, dequantization, entropyencoding/decoding, and in-loop filtering encoding/decoding may beperformed according to at least one of a size, a form, and a depth of asub-block.

A current block (CU) may mean a leaf node of at least one of aquad-tree, a binary-tree, and a three division tree, at least oneencoding/decoding of intra/inter-prediction, primary/secondary transformand inverse-transform, quantization, dequantization, entropyencode/decode, and in-loop filtering encoding/decoding which areperformed for encoding/decoding the current block may be performedaccording to at least one of a size, a form, and a depth of a sub-block.

In an example, when encoding a current block (CU),intra/inter-prediction may be performed according to at least one of asize, a form, and a depth of a sub-block. Primary/secondary transformand inverse-transform, quantization, dequantization, entropyencoding/decoding and in-loop filtering, other thanintra/inter-prediction, may be performed according to at least one of asize, a form, and a depth of the current block.

In another example, when a current block is divided into two sub-blocks(for example, first sub-block and second sub-block), differentintra-prediction information may be derived from the first sub-block andthe second sub-block.

In another example, when a current block is divided into two sub-blocks(for example, first sub-block and second sub-block), differentinter-prediction information may be derived from the first sub-block andthe second sub-block.

In another example, when a current block is divided into two sub-blocks(for example, first sub-block and second sub-block), combinedintra-prediction or inter-prediction information or both may be derivedfrom the first sub-block and the second sub-block. Herein,inter-prediction information may be derived from the first sub-block,and intra-prediction information may be derived from the secondsub-block. Alternatively, intra-prediction information may be derivedfrom the first sub-block, and inter-prediction information may bederived from the second sub-block.

In another example, when encoding a current block (CU),primary/secondary transform and inverse-transform may be performedaccording to at least one of a size, a form, and a depth of a sub-block.Intra-prediction or inter-prediction or both, quantization,dequantization, entropy encoding/decoding, and in-loop filtering, otherthan primary/secondary transform and inverse-transform, may be performedaccording to at least one of a size, a form, and a depth of the currentblock.

In another example, when a current block is divided into two sub-blocks(for example, first sub-block and second sub-block), primary/secondarytransform and inverse-transform may be omitted for the first sub-blockor second sub-block or both, or different primary/secondary transformand different inverse-transform may be performed for the first sub-blockor second sub-block or both.

In another example, when a current block is divided into two sub-blocks(for example, first sub-block and second sub-block), secondary transformand inverse-transform may be omitted for the first sub-block or secondsub-block or both, or different primary/secondary transform anddifferent inverse-transform may be performed for the first sub-block orsecond sub-block or both.

In another example, when encoding a current block (CU), quantization anddequantization may be performed according to at least one of a size, aform, and a depth of a sub-block. Intra-prediction or inter-predictionor both, primary/secondary transform and inverse-transform, entropyencoding/decoding, and in-loop filtering, other than quantization anddequantization, may be performed according to at least one of a size, aform, and a depth of the current block.

In another example, when a current block is divided into two sub-blocks(for example, first sub-block and second sub-block), quantization anddequantization may be omitted for the first sub-block or secondsub-block or both, or different quantization and differentdequantization may be performed for the first sub-block or secondsub-block or both

In another example, when a current block is divided into two sub-blocks(for example, first sub-block and second sub-block), the first sub-blockmay be quantized according to a quantization parameter set when encodingis performed at first, and the second sub-block may be encoded/decodedby using a quantization parameter differing from the quantizationparameter set at first. Herein, a quantization parameter or an offset orboth of a second sub-block using a quantization parameter different fromthe quantization parameter set at first may be explicitly transmitted,or may be implicitly derived according to a method set in theencoder/decoder.

In another example, when a current block is divided into two sub-blocks(for example, first sub-block and second sub-block), the secondsub-block may be quantized according to a quantization parameter setwhen encoding is performed at first, and the first sub-block may beencoded/decoded by using a quantization parameter differing from thequantization parameter set at first. Herein, a quantization parameter oran offset or both of a first sub-block using a quantization parameterdifferent from the quantization parameter set at first may be explicitlytransmitted, or may be implicitly derived according to a method set inthe encoder/decoder.

In another example, when encoding a current block (CU), entropyencoding/decoding may be performed according to at least one of a size,a form, and a depth of a sub-block. Intra-prediction or inter-predictionor both, primary/secondary transform and inverse-transform, quantizationand dequantization, and in-loop filtering, other than entropyencoding/decoding, may be performed according to at least one of a size,a form, and a depth of the current block.

In another example, when encoding a current block (CU), in-loopfiltering may be performed according to at least one of a size, a form,and a depth of a sub-block. Intra-prediction or inter-prediction orboth, primary/secondary transform and inverse-transform, entropyencoding/decoding, and quantization and dequantization, other thanin-loop filtering, may be performed according to at least one of a size,a form, and a depth of the current block.

In another example, when a current block is divided into two sub-blocks(for example, first sub-block and second sub-block), in-loop filteringmay be omitted for the first sub-block or second sub-block or both, ordifferent in-loop filtering may be performed for the first sub-block orsecond sub-block or both.

When a current block is divided into at least one of a symmetric orasymmetric sub-block or both, a flag whether or not division intosub-blocks is performed or index information of a sub-block divisiontype or both may be signaled in a block (CU) unit through a bitstream.Alternatively, the same may be variably derived on the basis of a codingparameter of a current block. Herein, a sub-block division type may bedefined by using at least one asymmetric sub-block division typedescribed with (a) of FIG. 16 to (k) of FIG. 16 , and thenencoding/decoding of a current block may be performed. Alternatively, asub-block division type may be a block form that is predefined in theencoder/decoder, other than symmetric sub-block division types describedwith (a) of FIG. 16 to (k) of FIG. 16 , and may include at least onearbitrary block form among sub-blocks other than a square or rectangleform or both. Meanwhile, a sub-block division type may includeinformation of at least one of a division direction of a current blockso as to being divided into sub-blocks, a sub-block form, a formationrelation between the current block and the sub-block, and a formationrelation between sub-blocks.

For example, when using at least one type of (a) of FIG. 16 to (k) ofFIG. 16 , a flag of whether or not encoding and decoding is performed onthe basis of a sub-block or a sub-block partitioning index (or sub-blockdivision type) or both may be signaled through a bitstream, or may bevariably derived on the basis of a coding parameter of a current block.Herein, when explicitly transmitting index information, at least one ofa truncated rice binarization method, a K-th order exp_golombbinarization method, a restricted K-th order exp_golomb) binarizationmethod, a fixed-length binarization method, a unary binarization method,and a truncated unary binarization method may be used. In addition,encoding/decoding may be finally performed for a current block by usingCABAC(ae(v)) after performing binarization.

In addition, for example, when using at least two types of (a) of FIG.16 and (b) of FIG. 16 , a flag representing whether or not sub-blockdivision in a triangle form is performed for a current block (CU) may besignaled.

The flag may be signaled in a unit of at least one of a VPS, an SPS, aPPS, a tile header, a slice header, a CTU, and a CU. In addition, theflag may be signed in case of a specific slice (for example, B slice).

In addition, when sub-block division in a triangle form is performed fora current block (CU), an index indicating at least one of directioninformation which divides the CU into a triangle-form sub-block andmotion information of the triangle-form sub-block may be signaled. Theindex may be variably derived on the basis of a coding parameter of acurrent block.

Meanwhile, when the flag indicates a first value, it may indicate thatmotion prediction/compensation based on a triangle-form sub-block may beused for generating a prediction sample of a current block (CU). Inaddition, meanwhile, the index may be signaled when the flag indicates afirst value.

An index range may be from 0 to M. M may be a positive integer greaterthan 0. For example, M may be 39.

In addition, the encoder/decoder may store a table of list for derivinga division direction through which a current block is divided into anarbitrary sub-block or motion information of the sub-block from theindex.

Table 1 is an example of a look-up table showing a direction of dividinga current block into a triangle-form sub-block. A direction of dividinginto a triangle-form sub-block may be derived on the basis of the indexdescribed above.

TABLE 1 merge_triangle_idx [xCb] [yCb] 0 1 2 3 4 5 6 7 8 9 10 11 12 1314 15 16 17 18 19 TriangleDir 0 1 1 0 0 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1merge_triangle_idx [xCb] [yCb] 20 21 22 23 24 25 26 27 28 29 30 31 32 3334 35 36 37 38 39 TriangleDir 1 0 0 1 1 1 1 1 1 1 0 0 1 0 1 0 0 1 0 0

Referring to Table 1, when a value of TriangleDir has a first value of0, it may mean that a current block is divided into two triangle-formsub-blocks by dividing the same by a diagonal boundary from left-upperto right-lower. For example, it may mean a division form of (a) of FIG.16 . In addition, when a value of TriangleDir have a second value of 1,it may mean that a current block is divided into two triangle-formsub-blocks by dividing the same by a diagonal boundary from right-upperto left-lower. For example, it may mean a division form of (b) of FIG.16 . Meanwhile, the first value and the second value may be interchangedfrom each other.

Meanwhile, an index (merge_triangle_idx) range indicating a direction fthe sub-bloc division may be from 0 to 39. The index may be signaled fora current block. The index information may be identical to indexinformation indicating a merge candidate used in each sub-block whichwill be described in Table 2 later.

Meanwhile, at least one of a flag and an index which is entropy encodedin the encoder and entropy decoded in the decoder may use at least oneof binarization methods below.

Truncated rice binarization method

K-th order exp_golomb binarization method

Restricted K-th order exp_golomb binarization method

Fixed-length binarization method

Unary binarization method

Truncated unary binarization method

A method of deriving intra/intra-prediction information betweensub-blocks will be described.

When a current block is divided into at least one of a symmetric orasymmetric sub-block or both, prediction information of the currentblock may be derived by using at least one of deriving inter-predictioninformation different between sub-blocks from each sub-block, derivingintra-prediction information different between sub-blocks from eachsub-block, and deriving combined intra/inter-prediction informationbetween sub-blocks.

Inter-prediction information may mean at least one of motion informationused for motion prediction/compensation (for example, at least one of amotion vector, an inter-prediction indicator, a reference video index, aPOC, a skip flag, a merge flag, an merge index, an affine flag, an OBMCflag, bilateral matching or template matching flag or both, and a BIO(bi-directional optical flow). Meanwhile, inter-prediction informationand motion information may be defined as the same meaning.

Intra-prediction information may mean intra-prediction mode informationused for generating an intra-prediction block (for example, at least oneof an MPM flag, an MPM index, a selected modes set flag, a selected modeindex, and a remaining mode index.

Intra-prediction or inter-prediction information or both may beexplicitly transmitted through a bitstream from the encoder to thedecoder, or may be variably derived on the basis of a current block orat least one of a size, a form, and a depth of a sub-block or both. Inaddition, intra-prediction or inter-prediction information or both maybe variably derived on the basis of a coding parameter of a currentblock or a sub-block or both, or may be signaled through a bitstream.

A method of deriving inter-prediction information between sub-blockswill be described.

When a current block is divided into at least one of a symmetric orasymmetric sub-block or both, inter-prediction information differentbetween sub-blocks may be derived from each sub-block. Herein,inter-prediction information may be derived by using at least oneinter-prediction method of a skip mode for each sub-block, a merge mode,an AMVP mode, motion prediction/compensation using an affine transformformula, bilateral matching, template matching, and motionprediction/compensation based on OBMC.

In FIG. 16 , when a current block is divided into two sub-blocks,different inter-prediction information may be derived from a firstsub-block (or sub-block A) or a second sub-block (or sub-block B). Whenderiving inter-prediction information of a first sub-block, motioninformation may be derived by using at least one inter-prediction methodof a skip mode for each sub-block, a merge mode, an AMVP mode, motionprediction/compensation using an affine transform formula, bilateralmatching, template matching, and motion prediction/compensation based onOBMC. In addition, when deriving prediction information of a secondsub-block, motion information may be derived by using at least oneinter-prediction method of a skip mode for each sub-block, a merge mode,an AMVP mode, motion prediction/compensation using an affine transformformula, bilateral matching, template matching, and motionprediction/compensation based on OBMC.

In FIG. 16 , when a current block is divided into two sub-blocks, motioninformation may be derived in a unit of a lowest level sub-block fromeach sub-block. Herein, the lowest level sub-block may mean the smallestblock unit having a predetermined size. For example, a block size of a4×4 block may be defined as the lowest level sub-block.

In FIG. 16 , when a current block is divided into two sub-blocks, skipmode based different motion prediction/compensation may be performed forall sub-blocks according to each sub-block form. Herein, two pieces ofdifferent motion information (for example, at least one of a skip flagor merge index information or both, and a POC) of a current block may beexplicitly transmitted.

In FIG. 16 , when a current block is divided into two sub-blocks, mergemode based different motion prediction/compensation may be performed forall sub-blocks according to each sub-block form. Herein, two differentpieces of motion information (for example, at least one of a merge flagor merge index information or both, and a POC) of a current block may beexplicitly transmitted.

In (a) of FIG. 16 or (b) of FIG. 16 or both, when a current block isdivided into two triangle-form sub-blocks, merge mode-based motionprediction/compensation for a first sub-block or second sub-block orboth may be performed on the basis of different motion information.Herein, two pieces of different motion information of a current blockmay be derived by configuring a merge candidate list on the basis of adifferent merge candidate of each sub-block. For example, motioninformation of a current block may be derived by configuring a mergecandidate list including a spatial merge candidate, a temporal mergecandidate, a combined merge candidate, a zero merge candidate, etc. andby using a different merge candidate of each sub-block. N may mean anatural number value greater than 0. When configuring the mergecandidate list, when a corresponding merge candidate includesbi-directional motion information, a merge candidate list configuredwith uni-directional prediction candidates may be configured so as toreduce a memory bandwidth. For example, for the bi-directional motioninformation, L0 or L1 motion information may be added to a list, or anaverage value or weighted sum of L0 and L1 motion information may beadded to the list. Meanwhile, when using a different merge candidate foreach sub-block, a predefined value may be used.

In an example, when using a different merge candidate for eachsub-block, for a first sub-block (or sub-block A), an N-th candidatewithin a merge candidate list may be used, and for a second sub-block(or sub-block B), an M-th candidate within the merge candidate list maybe used. N and M may be a natural number including 0, and N and M may bethe same or different from each other. Meanwhile, N and M may be a valuepredefined in the encoder/decoder.

In another example, when using a different merge candidate for eachsub-block, for a merge candidate (or index information of a mergecandidate) in association with each sub-block, a merge candidate group(or merge candidate group list or table) may be defined and used. Themerge candidate group may include a pair of merge candidates for eachsub-block as an element. In addition, when a number of merge candidatesconfigured with a spatial merge candidate, a temporal merge candidate, acombined merge candidate, a zero merge candidate, etc. is N, each mergecandidate in association with each sub-block may have a value from 0 toN−1. Herein, N is a natural number larger than 0.

Table 2 shows an example of a look-up table representing a mergecandidate used in each sub-block.

TABLE 2 merge_triangle_idx [xCb] [yCb] 0 1 2 3 4 5 6 7 8 9 10 11 12 1314 15 16 17 18 19 A 1 0 0 0 2 0 0 1 3 4 0 1 1 0 0 1 1 1 1 2 B 0 1 2 1 03 4 0 0 0 2 2 2 4 3 3 4 4 3 1 merge_triangle_idx [xCb] [yCb] 20 21 22 2324 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 A 2 2 4 3 3 3 4 3 2 4 42 4 3 4 3 2 2 4 3 B 0 1 3 0 2 4 0 1 3 1 1 3 2 2 3 1 4 4 2 4

Referring to Table 2, as shown in (a) of FIG. 16 or (b) of FIG. 16 ,when a current block is divided into two triangle-form sub-blocks, A maymean a first sub-block (or sub-block A), and B may mean a secondsub-block (or sub-block B). In addition, when a number of mergecandidates configured with a spatial merge candidate, a temporal mergecandidate, a combined merge candidate, a zero merge candidate, etc. isfive, A and B may respectively have a value from 0 to 4.

Meanwhile, an index (merge_triangle_idx) range indicating indexinformation of a merge candidate mapped to each sub-block may be from 0to M. M may be a positive integer greater than 0. For example, in Table2, M may be 39. The index may be signaled for a current block.Accordingly, motion information of a sub-block may be derived on thebasis of the index. Meanwhile, the index information may be identical toindex information indicating division direction information of asub-block described in Table 1.

Meanwhile, the encoder/decoder may store a table or list for deriving adivision direction through which a current block is divided into anarbitrary sub-block, or motion information of the sub-block from theindex.

In FIG. 16 , when a current block is divided into two sub-blocks,bilateral matching based motion prediction/compensation may be performedfor a first sub-block, and template matching based motionprediction/compensation may be performed for a second sub-block. Herein,motion information of each sub-block (for example, at least one of amotion vector, an inter-prediction indicator, a reference video index,and a POC) may be explicitly transmitted from the encoder, or may beimplicitly derived in the encoder/decoder.

In FIG. 16 , when a current block is divided into two sub-blocks,template matching based motion prediction/compensation may be performedfor a first sub-block, and bilateral matching based motionprediction/compensation may be performed for a second sub-block. Herein,motion information of each sub-block (for example, at least one of amotion vector, an inter-prediction indicator, a reference video index,and a POC) may be explicitly transmitted from the encoder, or may beimplicitly derived in the encoder/decoder.

In FIG. 16 , when a current block is divided into two sub-blocks, motionprediction/compensation for a first sub-block may be performed by usingmotion information of a spatially adjacent block, and inter-predictioninformation of a second sub-block may be derived by using at least oneinter-prediction method of a skip mode, a merge mode, an AMVP mode, anaffine transform formula, and motion prediction/compensation based onbilateral matching, template matching, and OBMC based motionprediction/compensation.

In FIG. 16 , when a current block is divided into two sub-blocks, motionprediction/compensation for a second sub-block may be performed by usingmotion information of a spatially adjacent block, and inter-predictioninformation of a first sub-block may be derived by using at least oneinter-prediction method of a skip mode, a merge mode, an AMVP mode, anaffine transform formula, and motion prediction/compensation based onbilateral matching, template matching, and OBMC based motionprediction/compensation.

Meanwhile, by using motion information of a spatially adjacent block,motion information of a first sub-block or second sub-block or both forwhich motion prediction/compensation is performed may be derived in aunit of a lowest level sub-block having a predetermined size.

FIG. 17 is a view showing a method of deriving motion predictioninformation of a sub-block by using a lowest level sub-block accordingto an embodiment of the present invention.

In (c) of FIG. 16 , when a current block is divided into two asymmetricsub-blocks and motion prediction/compensation for a first sub-block isperformed by using motion information of a spatially adjacent block,referring to FIG. 17 , motion prediction/compensation for the firstsub-block is performed in a unit of the lowest level sub-block of afirst sub-block, and thus motion information of the spatially adjacentlowest level sub-block positioned at left or upper or both of the lowestlevel sub-block may be implicitly derived as motion information of thefirst sub-block. Herein, a size of the lowest level sub-block may be4×4. Herein, motion information of a second sub-block may be explicitlyderived by using an AMVP mode.

In FIG. 17 , motion information of a left-upper lowest level sub-blockamong lowest level sub-blocks of a first sub-block may be derived byusing at least one of motion information of spatially adjacent left,upper, and left-upper lowest level sub-blocks. Herein, motioninformation of a left-upper lowest level sub-block may use motioninformation of one lowest level sub-block among spatially adjacent left,upper, and left-upper lowest level sub-blocks, or motion information maybe derived on the basis of at least one of an average value, a mode, aweighted sum of up to three adjacent lowest level sub-blocks.

In FIG. 17 , motion information of a lowest level sub-block of a firstsub-block may be derived by using at least one of a spatially adjacentleft or upper lowest level sub-block or both.

In FIG. 17 , when motion information is not present in spatiallyadjacent left or upper lowest level sub-block or both, for motioninformation of a lowest level sub-block of a first sub-block, motioninformation may be derived in left or upper lowest level sub-block orboth that are adjacent to the spatially adjacent left or upper lowestlevel sub-block or both.

In FIG. 17 , when motion information is not present in spatiallyadjacent left or upper lowest level sub-block or both, motioninformation of a lowest level sub-block of a first sub-block may bereplaced with motion information of a second sub-block derived by usingan AMVP mode.

In FIG. 16 , when a current block is divided into two sub-blocks, motionprediction/compensation for a first sub-block may be performed by usingmotion information of a merge candidate list, and inter-predictioninformation of a second sub-block may be derived by using at least oneinter-prediction method of a skip mode, a merge mode, an AMVP mode, anaffine transform formula, and motion prediction/compensation based onbilateral matching, template matching, and OBMC based motionprediction/compensation. Alternatively, motion prediction/compensationfor a second sub-block may be performed by using motion information of amerge candidate list, and inter-prediction information of a firstsub-block may be derived by using at least one inter-prediction methodof a skip mode, a merge mode, an AMVP mode, an affine transform formula,and motion prediction/compensation based on bilateral matching, templatematching, and OBMC based motion prediction/compensation.

According to an example described above, by using at least one of motioninformation of a merge candidate list, motion information of a firstsub-block or second sub-block or both for which motionprediction/compensation is performed may be derived in a unit of alowest level sub-block having a predetermined size.

In (c) of FIG. 16 , when a current block is divided into two asymmetricsub-blocks, motion information of a first sub-block may be implicitlyderived by using at least one of motion information of a merge candidatelist.

In an example, the first piece of motion information of a mergecandidate list of a current block may be derived as motion informationof the first sub-block.

In another example, motion information of a first sub-block may bederived by using at least one of motion information derived in A0, A1,B0, B1, B2, C3, and H of FIG. 9 .

In another example, motion information of a lowest level sub-blockpositioned at the left of a first sub-block may be derived by using atleast one of motion information derived in A0, A1, and B2 of FIG. 9 . Inaddition, motion information of a lowest level sub-block positioned atthe upper of a first sub-block may be derived by using at least one ofmotion information derive in B0, B1, and B2 of FIG. 9 .

In FIG. 16 , when a current block is divided into two sub-blocks, motionprediction/compensation for a first sub-block may be performed by usingmotion information used in an AMVP mode, and inter-predictioninformation of a second sub-block may be derived by using at least oneinter-prediction method of a skip mode, a merge mode, an AMVP mode, anaffine transform formula, and motion prediction/compensation based onbilateral matching, template matching, and OBMC based motionprediction/compensation. Alternatively, motion prediction/compensationfor a second sub-block may be performed by using motion information usedin an AMVP mode, and inter-prediction information of a first sub-blockmay be derived by using at least one inter-prediction method of a skipmode, a merge mode, an AMVP mode, an affine transform formula, andmotion prediction/compensation based on bilateral matching, templatematching, and OBMC based motion prediction/compensation.

According to an example described above, by using at least one of motioninformation used in an AMVP mode, motion information of a firstsub-block or second sub-block or both for which motionprediction/compensation is performed may be derived in a unit of thelowest level sub-block having a predetermined size.

In (a) of FIG. 16 , when a current block is divided into two asymmetricsub-blocks, motion information of a first sub-block may be implicitlyderived by using at least one of motion information of a motion vectorcandidate list used in an AMVP mode.

In an example, the first piece of motion information of a motion vectorcandidate list used in an AMVP mode of a current block may be derived asmotion information of the first sub-block.

In another example, motion information of a first sub-block may bederived by using a zero motion vector.

Hereinafter, a method of deriving intra-prediction information betweensub-blocks will be described.

When a current block is divided into at least one of a symmetric orasymmetric sub-block or both, intra-prediction information differentbetween sub-blocks may be derived from each sub-block. Herein, for asub-block of a current block, different intra-prediction information maybe derived in a unit of a lowest level sub-block. A lowest levelsub-block may mean the smallest block unit having a predetermined size.A 4×4 block size may be defined as a size of a lowest level sub-block.

In FIG. 16 , when a current block is divided into two sub-blocks,intra-prediction information may be derived from a first sub-block (orsub-block A) or a second sub-block (or sub-block B) in a unit of alowest level sub-block having a predetermined size.

In (c) of FIG. 16 , when intra-prediction is performed for a firstsub-block by using intra-prediction information of a spatially adjacentblock, referring to FIG. 17 , motion prediction/compensation for a firstsub-block may be performed in a unit of a lowest level sub-block of afirst sub-block, and thus intra-prediction information of the spatiallyadjacent lowest level sub-block positioned at left or upper of thelowest level sub-block or both may be implicitly derived as motioninformation of the first sub-block. Herein, a size of the lowest levelsub-block may be 4×4. Herein, for intra-prediction information of asecond sub-block, intra-prediction mode information that minimizes adistortion of the second sub-block may be implicitly derived by using areference sample adjacent to a current block.

For example, for a distortion, a prediction block of a current blocksize may be generated by using a reference sample adjacent to thecurrent block, and an intra-prediction mode in which SAD (sum ofabsolute differences) or SAID (sum of absolute transformed differences)or both become minimum in a practical second sub-block area may bederived as an intra-prediction mode of a second sub-block.

In FIG. 17 , an intra-prediction mode of a left-upper lowest levelsub-block among lowest level sub-blocks of a first sub-block may bederived by using at least one of intra-prediction mode information ofspatially adjacent left, upper, and left-upper lowest level sub-blocks.Herein, as intra-prediction mode information of a left-upper lowestlevel sub-block, intra-prediction mode information of one lowest levelsub-block may be used among spatially adjacent left, upper, andleft-upper lowest level sub-blocks. Alternatively, intra-prediction modeinformation of a current lowest level sub-block may be derived by usingat least one of an average value, a mode, a weighted sum of up to threepieces of intra-prediction mode of neighbor lowest level sub-blocks.

In FIG. 17 , intra-prediction mode information of a lowest levelsub-block of a first sub-block may be derived by using at least one of aspatially adjacent left or upper lowest level sub-block or both.

In FIG. 17 , when intra-prediction mode information is not present in aspatially adjacent left or upper lowest level sub-block or both,intra-prediction mode information of a lowest level sub-block of a firstsub-block may be derived in a lowest level sub-block adjacent to thespatially adjacent left or upper lowest level sub-block or both. Theneighbor may be the left or upper or both sides.

In FIG. 17 , when intra-prediction mode information is not present in aspatially adjacent left or upper lowest level sub-block or both,intra-prediction mode information of a lowest level sub-block of a firstsub-block may be replaced with intra-prediction mode information derivedin a second sub-block.

When generating an intra-prediction block of a first sub-block, in aunit of a lowest level sub-block, a final prediction block may begenerated by using a weighted sum of prediction blocks after generatingat least one intra-prediction block.

For example, according to a method described above, a prediction block(pred_1) may be generated by using an intra-prediction mode that isimplicitly derived in a first sub-block in a unit of a lowest levelsub-block, and then a prediction block (pred_2) may be generated byapplying an intra-prediction mode derived in the second sub-block to alowest level sub-block of the first sub-block. Subsequently, aprediction block of lowest level sub-block of the first sub-block may begenerated by a weighted sum or average value of both of pred_1 or pred_2or both.

Hereinafter, a method of deriving combined intra/inter-predictioninformation between sub-blocks will be described.

When a current block is divided into at least one of a symmetric orasymmetric sub-block or both, intra-prediction or inter-predictioninformation or both different between sub-blocks may be derived fromeach sub-block. Herein, for a sub-block of a current block,intra-prediction or inter-prediction information or differentintra-prediction and inter-prediction information may be derived in aunit of a lowest level sub-block. A lowest level sub-block may mean thesmallest block unit having a predetermined size. A 4×4 block size may bedefined as a size of a lowest level sub-block.

In FIG. 16 , when a current block is divided into two sub-blocks,intra-prediction information may be derived from a first sub-block, andinter-prediction information may be derived from a second sub-block.

In FIG. 16 , when a current block is divided into two sub-blocks,intra-prediction information in a unit of a lowest level sub-block maybe derived from a first sub-block, and inter-prediction information maybe derived from a second sub-block.

In FIG. 16 , when a current block is divided into two sub-blocks,intra-prediction information may be derived from a first sub-block, andinter-prediction information in a unit of a lowest level sub-block maybe derived from a second sub-block.

In FIG. 16 , when a current block is divided into two sub-blocks,intra-prediction information in a unit of a lowest level sub-block maybe derived from a first sub-block, and inter-prediction information in aunit of a lowest level sub-block may be derived from a second sub-block.

In FIG. 16 , when a current block is divided into two sub-blocks,inter-prediction information may be derived from a first sub-block, andintra-prediction information may be derived from a second sub-block.

In FIG. 16 , when a current block is divided into two sub-blocks,inter-prediction information in a unit of a lowest level sub-block maybe derived from a first sub-block, and intra-prediction information maybe derived from a second sub-block.

In FIG. 16 , when a current block is divided into two sub-blocks,inter-prediction information may be derived from a first sub-block, andintra-prediction information in a unit of a lowest level sub-block maybe derived from a second sub-block.

In FIG. 16 , when a current block is divided into two sub-blocks,inter-prediction information in a unit of a lowest level sub-block maybe derived from a first sub-block, and intra-prediction information in aunit of a lowest level sub-block may be derived from a second sub-block.

FIG. 18 is a view of a flowchart of a video encoding method an accordingto an embodiment of the present invention.

Referring to FIG. 18 , in S1801, the encoder may divide a coding unitinto a plurality of sub-units according to a block division structure.

Meanwhile, a block division structure may be a block division structurewhere division is performed such that at least one sub-unit having apredetermined block form is included other than a square form and arectangular form.

Meanwhile, the block division structure may be a block divisionstructure where division is performed such that the coding unit isdivided to include a triangular-form sub-unit.

Meanwhile, the triangular form may be at least one of a triangular formobtained by dividing by a diagonal boundary from the left-upper to theright-lower of the coding unit, and a triangular form obtained bydividing by a diagonal boundary from the right-upper to the left-lowerof the coding unit.

Meanwhile, the block division structure may be determined on the basisof a flag representing whether or not the coding unit is divided.

Meanwhile, the block division structure may be determined on the basisof a flag representing whether or not the coding unit is divided and anindex representing a division type of the sub-unit.

Meanwhile, a division type of the sub-unit may represent a divisiondirection of the sub-unit.

Subsequently, in S1802, the encoder may perform encoding based on thesub-unit.

Meanwhile, the encoder may perform encoding by performing prediction ofat least one of intra-prediction and inter-prediction based on thesub-unit. In addition, the encoder may perform encoding by performing atleast one of transform and quantization based on the sub-unit. Inaddition, the encoder may perform encoding in a lowest level sub-unit ofthe sub-unit,

A recording medium according to the present invention may store abitstream generated by a video encoding method, wherein the methodincludes: dividing a coding unit into a plurality of sub-units accordingto a block division structure; and performing encoding based on thesub-unit, wherein the block division structure includes at least onesub-unit having a predetermined block form other than square andrectangle forms.

The above embodiments may be performed in the same method in an encoderand a decoder.

A sequence of applying to above embodiment may be different between anencoder and a decoder, or the sequence applying to above embodiment maybe the same in the encoder and the decoder.

The above embodiment may be performed on each luma signal and chromasignal, or the above embodiment may be identically performed on luma andchroma signals.

A block form to which the above embodiments of the present invention areapplied may have a square form or a non-square form.

The above embodiment of the present invention may be applied dependingon a size of at least one of a coding block, a prediction block, atransform block, a block, a current block, a coding unit, a predictionunit, a transform unit, a unit, and a current unit. Herein, the size maybe defined as a minimum size or maximum size or both so that the aboveembodiments are applied, or may be defined as a fixed size to which theabove embodiment is applied. In addition, in the above embodiments, afirst embodiment may be applied to a first size, and a second embodimentmay be applied to a second size. In other words, the above embodimentsmay be applied in combination depending on a size. In addition, theabove embodiments may be applied when a size is equal to or greater thata minimum size and equal to or smaller than a maximum size. In otherwords, the above embodiments may be applied when a block size isincluded within a certain range.

For example, the above embodiments may be applied when a size of currentblock is 8×8 or greater. For example, the above embodiments may beapplied when a size of current block is 4×4 or greater. For example, theabove embodiments may be applied when a size of current block is 16×16or greater. For example, the above embodiments may be applied when asize of current block is equal to or greater than 16×16 and equal to orsmaller than 64×64.

The above embodiments of the present invention may be applied dependingon a temporal layer. In order to identify a temporal layer to which theabove embodiments may be applied may be signaled, and the aboveembodiments may be applied to a specified temporal layer identified bythe corresponding identifier. Herein, the identifier may be defined asthe lowest layer or the highest layer or both to which the aboveembodiment may be applied, or may be defined to indicate a specificlayer to which the embodiment is applied. In addition, a fixed temporallayer to which the embodiment is applied may be defined.

For example, the above embodiments may be applied when a temporal layerof a current image is the lowest layer. For example, the aboveembodiments may be applied when a temporal layer identifier of a currentimage is 1. For example, the above embodiments may be applied when atemporal layer of a current image is the highest layer.

A slice type to which the above embodiments of the present invention areapplied may be defined, and the above embodiments may be applieddepending on the corresponding slice type.

In the above-described embodiments, the methods are described based onthe flowcharts with a series of steps or units, but the presentinvention is not limited to the order of the steps, and rather, somesteps may be performed simultaneously or in different order with othersteps. In addition, it should be appreciated by one of ordinary skill inthe art that the steps in the flowcharts do not exclude each other andthat other steps may be added to the flowcharts or some of the steps maybe deleted from the flowcharts without influencing the scope of thepresent invention.

The embodiments include various aspects of examples. All possiblecombinations for various aspects may not be described, but those skilledin the art will be able to recognize different combinations.Accordingly, the present invention may include all replacements,modifications, and changes within the scope of the claims.

The embodiments of the present invention may be implemented in a form ofprogram instructions, which are executable by various computercomponents, and recorded in a computer-readable recording medium. Thecomputer-readable recording medium may include stand-alone or acombination of program instructions, data files, data structures, etc.The program instructions recorded in the computer-readable recordingmedium may be specially designed and constructed for the presentinvention, or well-known to a person of ordinary skilled in computersoftware technology field. Examples of the computer-readable recordingmedium include magnetic recording media such as hard disks, floppydisks, and magnetic tapes; optical data storage media such as CD-ROMs orDVD-ROMs; magneto-optimum media such as floptical disks; and hardwaredevices, such as read-only memory (ROM), random-access memory (RAM),flash memory, etc., which are particularly structured to store andimplement the program instruction. Examples of the program instructionsinclude not only a mechanical language code formatted by a compiler butalso a high level language code that may be implemented by a computerusing an interpreter. The hardware devices may be configured to beoperated by one or more software modules or vice versa to conduct theprocesses according to the present invention.

Although the present invention has been described in terms of specificitems such as detailed elements as well as the limited embodiments andthe drawings, they are only provided to help more general understandingof the invention, and the present invention is not limited to the aboveembodiments. It will be appreciated by those skilled in the art to whichthe present invention pertains that various modifications and changesmay be made from the above description.

Therefore, the spirit of the present invention shall not be limited tothe above-described embodiments, and the entire scope of the appendedclaims and their equivalents will fall within the scope and spirit ofthe invention.

INDUSTRIAL APPLICABILITY

The present invention may be used in encoding/decoding an image.

The invention claimed is:
 1. A method of decoding a video, the methodcomprising: determining a partitioning shape of a coding unit determinedto be geometrically partitioned from among a plurality of partitioningshape candidates, the plurality of partitioning shape candidatescomprising an asymmetrically divided shape; constructing a mergecandidate list of the coding unit including merge candidates;determining a first merge candidate and a second merge candidate fromthe merge candidates in the merge candidate list of the coding unit,wherein the first merge candidate is different from the second mergecandidate; deriving first geometrical partition motion information fromeither L0 motion information or L1 motion information of the first mergecandidate; deriving second geometrical partition motion information fromeither L0 motion information or L1 motion information of the secondmerge candidate; and decoding the coding unit based on the firstgeometrical partition motion information, the second geometricalpartition motion information and the partitioning shape of the codingunit.
 2. The method of claim 1, wherein whether to geometricallypartition a coding unit is determined based on a flag representingwhether or not the coding unit is geometrically partitioned.
 3. Themethod of claim 2, wherein the flag representing whether or not thecoding unit is geometrically partitioned is determined based on codingparameters of the coding unit.
 4. The method of claim 1, wherein thepartitioning shape is determined based on an index representing apartitioning shape of the coding unit.
 5. The method of claim 4, whereina partition direction and a partition distance of the coding unit isderived from the index representing the partitioning shape of the codingunit.
 6. The method of claim 1, wherein the first merge candidate andthe second merge candidate are determined based on first merge indexinformation and second merge index information of the coding unit.
 7. Amethod of encoding a video, the method comprising: determining apartition shape of a coding unit determined to be geometricallypartitioned from among a plurality of partitioning shape candidates, theplurality of partitioning shape candidates comprising an asymmetricallydivided shape; constructing a merge candidate list of the coding unitincluding merge candidates; determining a first merge candidate and asecond merge candidate from the merge candidates in the merge candidatelist of the coding unit, wherein the first merge candidate is differentfrom the second merge candidate; deriving first geometrical partitionmotion information from either L0 motion information or L1 motioninformation of the first merge candidate; deriving second geometricalpartition motion information from either L0 motion information or L1motion information of the second merge candidate; and encoding thecoding unit based on the first geometrical partition motion information,the second geometrical partition motion information and the partitioningshape of the coding unit.
 8. The method of claim 7, wherein whether togeometrically partition a coding unit is determined based on a flagrepresenting whether or not the coding unit is geometricallypartitioned.
 9. The method of claim 8, wherein the flag representingwhether or not the coding unit is geometrically partitioned isdetermined based on coding parameters of the coding unit.
 10. The methodof claim 7, wherein an index representing a partitioning shape of thecoding unit is encoded based on the partitioning shape.
 11. The methodof claim 1, wherein the index representing the partitioning shape of thecoding unit represents a partition direction and a partition distance ofthe coding unit.
 12. The method of claim 7, wherein first merge indexinformation and second merge index information of the coding unit isgenerated by encoding the first merge candidate and the second mergecandidate.
 13. A computer readable recording medium storing a bitstreamgenerated by a video encoding method, wherein the bitstream includesencoded video data, and wherein the encoding method includes:determining a partitioning shape of a coding unit determined to begeometrically partitioned from among a plurality of partitioning shapecandidates, the plurality of partitioning shape candidates comprising anasymmetrically divided shape; constructing a merge candidate list of thecoding unit including merge candidates; determining a first mergecandidate and a second merge candidate from the merge candidates in themerge candidate list of the coding unit, wherein the first mergecandidate is different from the second merge candidate; deriving firstgeometrical partition motion information from either L0 motioninformation or L1 motion information of the first merge candidate;deriving second geometrical partition motion information from either L0motion information or L1 motion information of the second mergecandidate; and encoding the coding unit based on the first geometricalpartition motion information, the second geometrical partition motioninformation and the partitioning shape of the coding unit.